Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times
Identifieur interne : 003574 ( Hal/Checkpoint ); précédent : 003573; suivant : 003575Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times
Auteurs : Julien Fondrevelle [France] ; Ammar Oulamara [France] ; Marie-Claude Portmann [France]Source :
- International Journal of Production Economics [ 0925-5273 ] ; 2008.
English descriptors
- mix :
Abstract
In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial applications. The objective is to minimize a non-classical criterion based on the weighted sum of machine completion times. We show that it generalizes makespan and we derive several complexity results for two- and three-machine problems. An exact algorithm based on a branch-and-bound procedure is developed to solve the permutation flowshop problem with m machines.
Url:
DOI: 10.1016/j.ijpe.2006.08.018
Links toward previous steps (curation, corpus...)
Links to Exploration step
Hal:hal-00235174Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times</title><author><name sortKey="Fondrevelle, Julien" sort="Fondrevelle, Julien" uniqKey="Fondrevelle J" first="Julien" last="Fondrevelle">Julien Fondrevelle</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-31213" status="OLD"><orgName>Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production</orgName><orgName type="acronym">LIESP</orgName><desc><address><addrLine>INSA de Lyon Bâtiment Blaise Pascal 7 Avenue Jean Capelle 69621 Villeurbanne Cedex</addrLine><country key="FR"></country></address><ref type="url">http://liesp.insa-lyon.fr/</ref></desc><listRelation><relation name="EA4125" active="#struct-33804" type="direct"></relation><relation active="#struct-194495" type="direct"></relation><relation active="#struct-219748" type="direct"></relation><relation active="#struct-301232" type="direct"></relation></listRelation><tutelles><tutelle name="EA4125" active="#struct-33804" type="direct"><org type="institution" xml:id="struct-33804" status="VALID"><orgName>Université Lumière - Lyon 2</orgName><orgName type="acronym">UL2</orgName><desc><address><addrLine>86, rue Pasteur - 69007 Lyon</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lyon2.fr</ref></desc></org></tutelle><tutelle active="#struct-194495" type="direct"><org type="institution" xml:id="struct-194495" status="VALID"><orgName>Université Claude Bernard Lyon 1</orgName><orgName type="acronym">UCBL</orgName><desc><address><addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lyon1.fr/</ref></desc></org></tutelle><tutelle active="#struct-219748" type="direct"><org type="institution" xml:id="struct-219748" status="VALID"><orgName>Institut National des Sciences Appliquées Lyon</orgName><orgName type="acronym">INSA Lyon</orgName><desc><address><addrLine>20 Avenue Albert Einstein, 69621 Villeurbanne cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.insa-lyon.fr/</ref></desc></org></tutelle><tutelle active="#struct-301232" type="direct"><org type="institution" xml:id="struct-301232" status="VALID"><orgName>Institut National des Sciences Appliquées</orgName><orgName type="acronym">INSA</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Lyon</settlement><region type="region" nuts="2">Auvergne-Rhône-Alpes</region><region type="old region" nuts="2">Rhône-Alpes</region></placeName><orgName type="university">Université Claude Bernard Lyon 1</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lyon</orgName></affiliation></author><author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName><orgName type="acronym">ORCHIDS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref></desc><listRelation><relation active="#struct-423085" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName><orgName type="acronym">LORIA - NSS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName><orgName type="acronym">ORCHIDS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref></desc><listRelation><relation active="#struct-423085" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName><orgName type="acronym">LORIA - NSS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00235174</idno><idno type="halId">hal-00235174</idno><idno type="halUri">https://hal.archives-ouvertes.fr/hal-00235174</idno><idno type="url">https://hal.archives-ouvertes.fr/hal-00235174</idno><idno type="doi">10.1016/j.ijpe.2006.08.018</idno><date when="2008">2008</date><idno type="wicri:Area/Hal/Corpus">003B65</idno><idno type="wicri:Area/Hal/Curation">003B65</idno><idno type="wicri:Area/Hal/Checkpoint">003574</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003574</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times</title><author><name sortKey="Fondrevelle, Julien" sort="Fondrevelle, Julien" uniqKey="Fondrevelle J" first="Julien" last="Fondrevelle">Julien Fondrevelle</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-31213" status="OLD"><orgName>Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production</orgName><orgName type="acronym">LIESP</orgName><desc><address><addrLine>INSA de Lyon Bâtiment Blaise Pascal 7 Avenue Jean Capelle 69621 Villeurbanne Cedex</addrLine><country key="FR"></country></address><ref type="url">http://liesp.insa-lyon.fr/</ref></desc><listRelation><relation name="EA4125" active="#struct-33804" type="direct"></relation><relation active="#struct-194495" type="direct"></relation><relation active="#struct-219748" type="direct"></relation><relation active="#struct-301232" type="direct"></relation></listRelation><tutelles><tutelle name="EA4125" active="#struct-33804" type="direct"><org type="institution" xml:id="struct-33804" status="VALID"><orgName>Université Lumière - Lyon 2</orgName><orgName type="acronym">UL2</orgName><desc><address><addrLine>86, rue Pasteur - 69007 Lyon</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lyon2.fr</ref></desc></org></tutelle><tutelle active="#struct-194495" type="direct"><org type="institution" xml:id="struct-194495" status="VALID"><orgName>Université Claude Bernard Lyon 1</orgName><orgName type="acronym">UCBL</orgName><desc><address><addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lyon1.fr/</ref></desc></org></tutelle><tutelle active="#struct-219748" type="direct"><org type="institution" xml:id="struct-219748" status="VALID"><orgName>Institut National des Sciences Appliquées Lyon</orgName><orgName type="acronym">INSA Lyon</orgName><desc><address><addrLine>20 Avenue Albert Einstein, 69621 Villeurbanne cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.insa-lyon.fr/</ref></desc></org></tutelle><tutelle active="#struct-301232" type="direct"><org type="institution" xml:id="struct-301232" status="VALID"><orgName>Institut National des Sciences Appliquées</orgName><orgName type="acronym">INSA</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Lyon</settlement><region type="region" nuts="2">Auvergne-Rhône-Alpes</region><region type="old region" nuts="2">Rhône-Alpes</region></placeName><orgName type="university">Université Claude Bernard Lyon 1</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lyon</orgName></affiliation></author><author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName><orgName type="acronym">ORCHIDS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref></desc><listRelation><relation active="#struct-423085" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName><orgName type="acronym">LORIA - NSS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName><orgName type="acronym">ORCHIDS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref></desc><listRelation><relation active="#struct-423085" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName><orgName type="acronym">LORIA - NSS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></analytic><idno type="DOI">10.1016/j.ijpe.2006.08.018</idno><series><title level="j">International Journal of Production Economics</title><idno type="ISSN">0925-5273</idno><imprint><date type="datePub">2008</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Branch-and-bound procedure</term><term>Flowshop</term><term>Idle time</term><term>Minimal and maximal time lags</term><term>Weighted sum of machine completion times</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial applications. The objective is to minimize a non-classical criterion based on the weighted sum of machine completion times. We show that it generalizes makespan and we derive several complexity results for two- and three-machine problems. An exact algorithm based on a branch-and-bound procedure is developed to solve the permutation flowshop problem with m machines.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times</title><author role="crp"><persName><forename type="first">Julien</forename><surname>Fondrevelle</surname></persName><email>julien.fondrevelle@insa-lyon.fr</email><idno type="halauthor">272173</idno><affiliation ref="#struct-31213"></affiliation></author><author role="aut"><persName><forename type="first">Ammar</forename><surname>Oulamara</surname></persName><email>oulamara@loria.fr</email><idno type="halauthor">54154</idno><affiliation ref="#struct-44715"></affiliation></author><author role="aut"><persName><forename type="first">Marie-Claude</forename><surname>Portmann</surname></persName><email>portmann@loria.fr</email><idno type="halauthor">54155</idno><affiliation ref="#struct-44715"></affiliation></author><editor role="depositor"><persName><forename>Julien</forename><surname>Fondrevelle</surname></persName><email>julien.fondrevelle@insa-lyon.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2008-02-04 09:35:48</date><date type="whenModified">2016-01-13 10:04:52</date><date type="whenReleased">2008-02-04 09:35:48</date><date type="whenProduced">2008</date></edition><respStmt><resp>contributor</resp><name key="120744"><persName><forename>Julien</forename><surname>Fondrevelle</surname></persName><email>julien.fondrevelle@insa-lyon.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">hal-00235174</idno><idno type="halUri">https://hal.archives-ouvertes.fr/hal-00235174</idno><idno type="halBibtex">fondrevelle:hal-00235174</idno><idno type="halRefHtml">International Journal of Production Economics, Elsevier, 2008, 112 (1), pp.168-176. <10.1016/j.ijpe.2006.08.018></idno><idno type="halRef">International Journal of Production Economics, Elsevier, 2008, 112 (1), pp.168-176. <10.1016/j.ijpe.2006.08.018></idno></publicationStmt><seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="LORIA2">Publications du LORIA</idno><idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno><idno type="stamp" n="INSA-LYON">Institut National des Sciences Appliquées de Lyon</idno><idno type="stamp" n="LIESP" p="INSA-LYON">Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production</idno><idno type="stamp" n="UNIV-LYON2">Université Lumière Lyon 2</idno></seriesStmt><notesStmt><note type="audience" n="2">International</note><note type="popular" n="0">No</note><note type="peer" n="1">Yes</note></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times</title><author role="crp"><persName><forename type="first">Julien</forename><surname>Fondrevelle</surname></persName><email>julien.fondrevelle@insa-lyon.fr</email><idno type="halAuthorId">272173</idno><affiliation ref="#struct-31213"></affiliation></author><author role="aut"><persName><forename type="first">Ammar</forename><surname>Oulamara</surname></persName><email>oulamara@loria.fr</email><idno type="halAuthorId">54154</idno><affiliation ref="#struct-44715"></affiliation></author><author role="aut"><persName><forename type="first">Marie-Claude</forename><surname>Portmann</surname></persName><email>portmann@loria.fr</email><idno type="halAuthorId">54155</idno><affiliation ref="#struct-44715"></affiliation></author></analytic><monogr><idno type="localRef">INSA -Lyon WOS</idno><idno type="halJournalId" status="VALID">5647</idno><idno type="issn">0925-5273</idno><title level="j">International Journal of Production Economics</title><imprint><publisher>Elsevier</publisher><biblScope unit="volume">112</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="pp">168-176</biblScope><date type="datePub">2008</date></imprint></monogr><idno type="doi">10.1016/j.ijpe.2006.08.018</idno></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="en">Flowshop</term><term xml:lang="en">Weighted sum of machine completion times</term><term xml:lang="en">Idle time</term><term xml:lang="en">Minimal and maximal time lags</term><term xml:lang="en">Branch-and-bound procedure</term></keywords><classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [cs.RO]</classCode><classCode scheme="halTypology" n="ART">Journal articles</classCode></textClass><abstract xml:lang="en">In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial applications. The objective is to minimize a non-classical criterion based on the weighted sum of machine completion times. We show that it generalizes makespan and we derive several complexity results for two- and three-machine problems. An exact algorithm based on a branch-and-bound procedure is developed to solve the permutation flowshop problem with m machines.</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003574 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 003574 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Hal
|étape= Checkpoint
|type= RBID
|clé= Hal:hal-00235174
|texte= Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times
}}
| This area was generated with Dilib version V0.6.33. |  |