InforLorV4, PascalFrancis, Corpus, bibRecord, 000452

Permutation flowshop scheduling problems with maximal and minimal time lags

Identifieur interne : 000452 ( PascalFrancis/Corpus ); précédent : 000451; suivant : 000453

Permutation flowshop scheduling problems with maximal and minimal time lags

Auteurs : Julien Fondrevelle ; Ammar Oulamara ; Marie-Claude Portmann

Source :

Computers & operations research [ 0305-0548 ] ; 2006.

RBID : Pascal:06-0240513

Descripteurs français

Pascal (Inist)
- Méthode séparation et évaluation, Problème NP difficile, Constante temps, Temps retard, Ordonnancement, Atelier monogamme, Permutation, Délai, Gestion tâche, Problème 2 machines, Délai maximal, Délai minimal.

English descriptors

KwdEn :
- Branch and bound method, Delay time, Flow shop, NP hard problem, Permutation, Scheduling, Task scheduling, Time constant, Time lag.

Abstract

In this paper, we study permutation flowshop problems with minimal and/or maximal time lags, where the time lags are defined between couples of successive operations of jobs. Such constraints may be used to model various industrial situations, for instance the production of perishable products. We present theoretical results concerning two-machine cases, we prove that the two-machine permutation flowshop with constant maximal time lags is strongly NP-hard. We develop an optimal branch and bound procedure to solve the m-machine permutation flowshop problem with minimal and maximal time lags. We test several lower bounds and heuristics providing upper bounds on different classes of benchmarks, and we carry out a performance analysis.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0305-0548`
A02	`01`			`@0 CMORAP`
A03		`1`		`@0 Comput. oper. res.`
A05				`@2 33`
A06				`@2 6`
A08	`01`	`1`	`ENG`	`@1 Permutation flowshop scheduling problems with maximal and minimal time lags`
A11	`01`	`1`		`@1 FONDREVELLE (Julien)`
A11	`02`	`1`		`@1 OULAMARA (Ammar)`
A11	`03`	`1`		`@1 PORTMANN (Marie-Claude)`
A14	`01`			`@1 MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt @2 54042 Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut.`
A20				`@1 1540-1556`
A21				`@1 2006`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 16412 @5 354000133040510030`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 18 ref.`
A47	`01`	`1`		`@0 06-0240513`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Computers & operations research`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 In this paper, we study permutation flowshop problems with minimal and/or maximal time lags, where the time lags are defined between couples of successive operations of jobs. Such constraints may be used to model various industrial situations, for instance the production of perishable products. We present theoretical results concerning two-machine cases, we prove that the two-machine permutation flowshop with constant maximal time lags is strongly NP-hard. We develop an optimal branch and bound procedure to solve the m-machine permutation flowshop problem with minimal and maximal time lags. We test several lower bounds and heuristics providing upper bounds on different classes of benchmarks, and we carry out a performance analysis.
C02	`01`	`X`		`@0 001D01A12`
C03	`01`	`X`	`FRE`	`@0 Méthode séparation et évaluation @5 01`
C03	`01`	`X`	`ENG`	`@0 Branch and bound method @5 01`
C03	`01`	`X`	`SPA`	`@0 Método branch and bound @5 01`
C03	`02`	`X`	`FRE`	`@0 Problème NP difficile @5 02`
C03	`02`	`X`	`ENG`	`@0 NP hard problem @5 02`
C03	`02`	`X`	`SPA`	`@0 Problema NP duro @5 02`
C03	`03`	`X`	`FRE`	`@0 Constante temps @5 03`
C03	`03`	`X`	`ENG`	`@0 Time constant @5 03`
C03	`03`	`X`	`SPA`	`@0 Constante tiempo @5 03`
C03	`04`	`X`	`FRE`	`@0 Temps retard @5 04`
C03	`04`	`X`	`ENG`	`@0 Delay time @5 04`
C03	`04`	`X`	`SPA`	`@0 Tiempo retardo @5 04`
C03	`05`	`X`	`FRE`	`@0 Ordonnancement @5 05`
C03	`05`	`X`	`ENG`	`@0 Scheduling @5 05`
C03	`05`	`X`	`SPA`	`@0 Reglamento @5 05`
C03	`06`	`X`	`FRE`	`@0 Atelier monogamme @5 06`
C03	`06`	`X`	`ENG`	`@0 Flow shop @5 06`
C03	`06`	`X`	`SPA`	`@0 Flow shop @5 06`
C03	`07`	`X`	`FRE`	`@0 Permutation @5 07`
C03	`07`	`X`	`ENG`	`@0 Permutation @5 07`
C03	`07`	`X`	`SPA`	`@0 Permutación @5 07`
C03	`08`	`X`	`FRE`	`@0 Délai @5 08`
C03	`08`	`X`	`ENG`	`@0 Time lag @5 08`
C03	`08`	`X`	`SPA`	`@0 Plazo @5 08`
C03	`09`	`X`	`FRE`	`@0 Gestion tâche @5 09`
C03	`09`	`X`	`ENG`	`@0 Task scheduling @5 09`
C03	`09`	`X`	`SPA`	`@0 Gestión labor @5 09`
C03	`10`	`X`	`FRE`	`@0 Problème 2 machines @4 INC @5 82`
C03	`11`	`X`	`FRE`	`@0 Délai maximal @4 INC @5 83`
C03	`12`	`X`	`FRE`	`@0 Délai minimal @4 INC @5 84`
N21				`@1 156`
N44	`01`			`@1 PSI`
N82				`@1 PSI`

Format Inist (serveur)

NO :	PASCAL 06-0240513 INIST
ET :	Permutation flowshop scheduling problems with maximal and minimal time lags
AU :	FONDREVELLE (Julien); OULAMARA (Ammar); PORTMANN (Marie-Claude)
AF :	MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt/54042 Nancy/France (1 aut., 2 aut., 3 aut.)
DT :	Publication en série; Niveau analytique
SO :	Computers & operations research; ISSN 0305-0548; Coden CMORAP; Royaume-Uni; Da. 2006; Vol. 33; No. 6; Pp. 1540-1556; Bibl. 18 ref.
LA :	Anglais
EA :	In this paper, we study permutation flowshop problems with minimal and/or maximal time lags, where the time lags are defined between couples of successive operations of jobs. Such constraints may be used to model various industrial situations, for instance the production of perishable products. We present theoretical results concerning two-machine cases, we prove that the two-machine permutation flowshop with constant maximal time lags is strongly NP-hard. We develop an optimal branch and bound procedure to solve the m-machine permutation flowshop problem with minimal and maximal time lags. We test several lower bounds and heuristics providing upper bounds on different classes of benchmarks, and we carry out a performance analysis.
CC :	001D01A12
FD :	Méthode séparation et évaluation; Problème NP difficile; Constante temps; Temps retard; Ordonnancement; Atelier monogamme; Permutation; Délai; Gestion tâche; Problème 2 machines; Délai maximal; Délai minimal
ED :	Branch and bound method; NP hard problem; Time constant; Delay time; Scheduling; Flow shop; Permutation; Time lag; Task scheduling
SD :	Método branch and bound; Problema NP duro; Constante tiempo; Tiempo retardo; Reglamento; Flow shop; Permutación; Plazo; Gestión labor
LO :	INIST-16412.354000133040510030
ID :	06-0240513

Links to Exploration step

Pascal:06-0240513

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Permutation flowshop scheduling problems with maximal and minimal time lags</title>
<author><name sortKey="Fondrevelle, Julien" sort="Fondrevelle, Julien" uniqKey="Fondrevelle J" first="Julien" last="Fondrevelle">Julien Fondrevelle</name>
<affiliation><inist:fA14 i1="01"><s1>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt</s1>
<s2>54042 Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name>
<affiliation><inist:fA14 i1="01"><s1>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt</s1>
<s2>54042 Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</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><inist:fA14 i1="01"><s1>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt</s1>
<s2>54042 Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0240513</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 06-0240513 INIST</idno>
<idno type="RBID">Pascal:06-0240513</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000452</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Permutation flowshop scheduling problems with maximal and minimal time lags</title>
<author><name sortKey="Fondrevelle, Julien" sort="Fondrevelle, Julien" uniqKey="Fondrevelle J" first="Julien" last="Fondrevelle">Julien Fondrevelle</name>
<affiliation><inist:fA14 i1="01"><s1>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt</s1>
<s2>54042 Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name>
<affiliation><inist:fA14 i1="01"><s1>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt</s1>
<s2>54042 Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</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><inist:fA14 i1="01"><s1>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt</s1>
<s2>54042 Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computers & operations research</title>
<title level="j" type="abbreviated">Comput. oper. res.</title>
<idno type="ISSN">0305-0548</idno>
<imprint><date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computers & operations research</title>
<title level="j" type="abbreviated">Comput. oper. res.</title>
<idno type="ISSN">0305-0548</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Branch and bound method</term>
<term>Delay time</term>
<term>Flow shop</term>
<term>NP hard problem</term>
<term>Permutation</term>
<term>Scheduling</term>
<term>Task scheduling</term>
<term>Time constant</term>
<term>Time lag</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Méthode séparation et évaluation</term>
<term>Problème NP difficile</term>
<term>Constante temps</term>
<term>Temps retard</term>
<term>Ordonnancement</term>
<term>Atelier monogamme</term>
<term>Permutation</term>
<term>Délai</term>
<term>Gestion tâche</term>
<term>Problème 2 machines</term>
<term>Délai maximal</term>
<term>Délai minimal</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this paper, we study permutation flowshop problems with minimal and/or maximal time lags, where the time lags are defined between couples of successive operations of jobs. Such constraints may be used to model various industrial situations, for instance the production of perishable products. We present theoretical results concerning two-machine cases, we prove that the two-machine permutation flowshop with constant maximal time lags is strongly NP-hard. We develop an optimal branch and bound procedure to solve the m-machine permutation flowshop problem with minimal and maximal time lags. We test several lower bounds and heuristics providing upper bounds on different classes of benchmarks, and we carry out a performance analysis.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0305-0548</s0>
</fA01>
<fA02 i1="01"><s0>CMORAP</s0>
</fA02>
<fA03 i2="1"><s0>Comput. oper. res.</s0>
</fA03>
<fA05><s2>33</s2>
</fA05>
<fA06><s2>6</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Permutation flowshop scheduling problems with maximal and minimal time lags</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>FONDREVELLE (Julien)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>OULAMARA (Ammar)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>PORTMANN (Marie-Claude)</s1>
</fA11>
<fA14 i1="01"><s1>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt</s1>
<s2>54042 Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>1540-1556</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>16412</s2>
<s5>354000133040510030</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>18 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>06-0240513</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Computers & operations research</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>In this paper, we study permutation flowshop problems with minimal and/or maximal time lags, where the time lags are defined between couples of successive operations of jobs. Such constraints may be used to model various industrial situations, for instance the production of perishable products. We present theoretical results concerning two-machine cases, we prove that the two-machine permutation flowshop with constant maximal time lags is strongly NP-hard. We develop an optimal branch and bound procedure to solve the m-machine permutation flowshop problem with minimal and maximal time lags. We test several lower bounds and heuristics providing upper bounds on different classes of benchmarks, and we carry out a performance analysis.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D01A12</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Méthode séparation et évaluation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Branch and bound method</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Método branch and bound</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Problème NP difficile</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>NP hard problem</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Problema NP duro</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Constante temps</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Time constant</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Constante tiempo</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Temps retard</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Delay time</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Tiempo retardo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Ordonnancement</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Scheduling</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Reglamento</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Atelier monogamme</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Flow shop</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Flow shop</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Permutation</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Permutation</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Permutación</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Délai</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Time lag</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Plazo</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Gestion tâche</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Task scheduling</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Gestión labor</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Problème 2 machines</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Délai maximal</s0>
<s4>INC</s4>
<s5>83</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Délai minimal</s0>
<s4>INC</s4>
<s5>84</s5>
</fC03>
<fN21><s1>156</s1>
</fN21>
<fN44 i1="01"><s1>PSI</s1>
</fN44>
<fN82><s1>PSI</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 06-0240513 INIST</NO>
<ET>Permutation flowshop scheduling problems with maximal and minimal time lags</ET>
<AU>FONDREVELLE (Julien); OULAMARA (Ammar); PORTMANN (Marie-Claude)</AU>
<AF>MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Parc de Saurupt/54042 Nancy/France (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Computers & operations research; ISSN 0305-0548; Coden CMORAP; Royaume-Uni; Da. 2006; Vol. 33; No. 6; Pp. 1540-1556; Bibl. 18 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper, we study permutation flowshop problems with minimal and/or maximal time lags, where the time lags are defined between couples of successive operations of jobs. Such constraints may be used to model various industrial situations, for instance the production of perishable products. We present theoretical results concerning two-machine cases, we prove that the two-machine permutation flowshop with constant maximal time lags is strongly NP-hard. We develop an optimal branch and bound procedure to solve the m-machine permutation flowshop problem with minimal and maximal time lags. We test several lower bounds and heuristics providing upper bounds on different classes of benchmarks, and we carry out a performance analysis.</EA>
<CC>001D01A12</CC>
<FD>Méthode séparation et évaluation; Problème NP difficile; Constante temps; Temps retard; Ordonnancement; Atelier monogamme; Permutation; Délai; Gestion tâche; Problème 2 machines; Délai maximal; Délai minimal</FD>
<ED>Branch and bound method; NP hard problem; Time constant; Delay time; Scheduling; Flow shop; Permutation; Time lag; Task scheduling</ED>
<SD>Método branch and bound; Problema NP duro; Constante tiempo; Tiempo retardo; Reglamento; Flow shop; Permutación; Plazo; Gestión labor</SD>
<LO>INIST-16412.354000133040510030</LO>
<ID>06-0240513</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000452 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000452 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:06-0240513
   |texte=   Permutation flowshop scheduling problems with maximal and minimal time lags
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Permutation flowshop scheduling problems with maximal and minimal time lags

Permutation flowshop scheduling problems with maximal and minimal time lags

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri