InforLorV4, Hal, Curation, bibRecord, 002D38

Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results

Identifieur interne : 002D38 ( Hal/Curation ); précédent : 002D37; suivant : 002D39

Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results

Auteurs : Lyès Benyoucef [France] ; Bernard Penz

Source :

RBID : Hal:inria-00071859

English descriptors

mix :
- changeover cost, complexity, dynamic programming approach, heuristic, scheduling, single machine.

Abstract

The problem studied in this paper originates from a just-in-time environment where a new supplying mode, called Synchronous Delivery, has been introduced recently. We consider a multi-product single machine scheduling problem in which the total changeover costs has to be minimized. The products are of different types and a changeover cost is incurred whenever switching from one product type to another. For each product, the processing time is equal to one and its deadline is different from deadlines of all other products. We present five complexity results and propose dynamic programming and heuristic approaches to the problem. Computational results are given comparing two heuristics to the optimal solution given by the dynamic programming method.

Url:

https://hal.inria.fr/inria-00071859

Links toward previous steps (curation, corpus...)

to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002D38

Links to Exploration step

Hal:inria-00071859

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results</title>
<author><name sortKey="Benyoucef, Lyes" sort="Benyoucef, Lyes" uniqKey="Benyoucef L" first="Lyès" last="Benyoucef">Lyès Benyoucef</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2353" status="OLD"><idno type="RNSR">199921393M</idno>
<orgName>Industrial system modeling, analysis and operation</orgName>
<orgName type="acronym">MACSI</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/macsi</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<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 name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</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>
<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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Penz, Bernard" sort="Penz, Bernard" uniqKey="Penz B" first="Bernard" last="Penz">Bernard Penz</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00071859</idno>
<idno type="halId">inria-00071859</idno>
<idno type="halUri">https://hal.inria.fr/inria-00071859</idno>
<idno type="url">https://hal.inria.fr/inria-00071859</idno>
<date when="2003">2003</date>
<idno type="wicri:Area/Hal/Corpus">002D38</idno>
<idno type="wicri:Area/Hal/Curation">002D38</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results</title>
<author><name sortKey="Benyoucef, Lyes" sort="Benyoucef, Lyes" uniqKey="Benyoucef L" first="Lyès" last="Benyoucef">Lyès Benyoucef</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2353" status="OLD"><idno type="RNSR">199921393M</idno>
<orgName>Industrial system modeling, analysis and operation</orgName>
<orgName type="acronym">MACSI</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/macsi</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<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 name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</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>
<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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Penz, Bernard" sort="Penz, Bernard" uniqKey="Penz B" first="Bernard" last="Penz">Bernard Penz</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>changeover cost</term>
<term>complexity</term>
<term>dynamic programming approach</term>
<term>heuristic</term>
<term>scheduling</term>
<term>single machine</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The problem studied in this paper originates from a just-in-time environment where a new supplying mode, called Synchronous Delivery, has been introduced recently. We consider a multi-product single machine scheduling problem in which the total changeover costs has to be minimized. The products are of different types and a changeover cost is incurred whenever switching from one product type to another. For each product, the processing time is equal to one and its deadline is different from deadlines of all other products. We present five complexity results and propose dynamic programming and heuristic approaches to the problem. Computational results are given comparing two heuristics to the optimal solution given by the dynamic programming method.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results</title>
<author role="aut"><persName><forename type="first">Lyès</forename>
<surname>Benyoucef</surname>
</persName>
<email></email>
<idno type="halauthor">99702</idno>
<affiliation ref="#struct-2353"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Bernard</forename>
<surname>Penz</surname>
</persName>
<email></email>
<idno type="idhal">bernard-penz</idno>
<idno type="halauthor">68859</idno>
</author>
<editor role="depositor"><persName><forename>Rapport De Recherche</forename>
<surname>Inria</surname>
</persName>
<email>rrrt-editeurs@inria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-05-23 18:59:10</date>
<date type="whenWritten">2003-02</date>
<date type="whenModified">2016-05-19 01:09:44</date>
<date type="whenReleased">2006-05-31 14:24:25</date>
<date type="whenProduced">2003</date>
<date type="whenEndEmbargoed">2006-05-23</date>
<ref type="file" target="https://hal.inria.fr/inria-00071859/document"><date notBefore="2006-05-23"></date>
</ref>
<ref type="file" n="1" target="https://hal.inria.fr/inria-00071859/file/RR-4727.pdf"><date notBefore="2006-05-23"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="111068"><persName><forename>Rapport De Recherche</forename>
<surname>Inria</surname>
</persName>
<email>rrrt-editeurs@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00071859</idno>
<idno type="halUri">https://hal.inria.fr/inria-00071859</idno>
<idno type="halBibtex">benyoucef:inria-00071859</idno>
<idno type="halRefHtml">[Research Report] RR-4727, INRIA. 2003, pp.27</idno>
<idno type="halRef">[Research Report] RR-4727, INRIA. 2003, pp.27</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-RRRT">Rapports de recherche et Technique de l'Inria</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="audience" n="0">Not set</note>
<note type="report" n="6">Research Report</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results</title>
<author role="aut"><persName><forename type="first">Lyès</forename>
<surname>Benyoucef</surname>
</persName>
<idno type="halAuthorId">99702</idno>
<affiliation ref="#struct-2353"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Bernard</forename>
<surname>Penz</surname>
</persName>
<idno type="idHal">bernard-penz</idno>
<idno type="halAuthorId">68859</idno>
</author>
</analytic>
<monogr><idno type="reportNumber">RR-4727</idno>
<imprint><biblScope unit="pp">27</biblScope>
<date type="datePub">2003</date>
</imprint>
<authority type="institution">INRIA</authority>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">scheduling</term>
<term xml:lang="en">single machine</term>
<term xml:lang="en">changeover cost</term>
<term xml:lang="en">complexity</term>
<term xml:lang="en">dynamic programming approach</term>
<term xml:lang="en">heuristic</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
<classCode scheme="halTypology" n="REPORT">Reports</classCode>
</textClass>
<abstract xml:lang="en">The problem studied in this paper originates from a just-in-time environment where a new supplying mode, called Synchronous Delivery, has been introduced recently. We consider a multi-product single machine scheduling problem in which the total changeover costs has to be minimized. The products are of different types and a changeover cost is incurred whenever switching from one product type to another. For each product, the processing time is equal to one and its deadline is different from deadlines of all other products. We present five complexity results and propose dynamic programming and heuristic approaches to the problem. Computational results are given comparing two heuristics to the optimal solution given by the dynamic programming method.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation

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

HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 002D38 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Curation
   |type=    RBID
   |clé=     Hal:inria-00071859
   |texte=   Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results
}}

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

Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results

Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results

Source :

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

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