Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach
Identifieur interne : 004020 ( Crin/Corpus ); précédent : 004019; suivant : 004021Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach
Auteurs : Julien Fondrevelle ; Ammar Oulamara ; Marie-Claude PortmannSource :
English descriptors
- KwdEn :
Abstract
In this article, we consider flowshop scheduling problems with time lags constraints to minimize the weighted sum of machine completion times as objective function. Although this criterion has been addressed in few papers, it may be extremely important in practical situations. We present several complexity results and propose different approaches to solve the m-machine case.
Links to Exploration step
CRIN:fondrevelle05aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="756">Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach</title></titleStmt><publicationStmt><idno type="RBID">CRIN:fondrevelle05a</idno><date when="2005" year="2005">2005</date><idno type="wicri:Area/Crin/Corpus">004020</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach</title><author><name sortKey="Fondrevelle, Julien" sort="Fondrevelle, Julien" uniqKey="Fondrevelle J" first="Julien" last="Fondrevelle">Julien Fondrevelle</name></author><author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>branch and bound</term><term>complexity</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" wicri:score="1035">In this article, we consider flowshop scheduling problems with time lags constraints to minimize the weighted sum of machine completion times as objective function. Although this criterion has been addressed in few papers, it may be extremely important in practical situations. We present several complexity results and propose different approaches to solve the m-machine case.</div></front></TEI><BibTex type="inproceedings"><ref>fondrevelle05a</ref><crinnumber>A05-R-008</crinnumber><category>3</category><equipe>MACSI</equipe><author><e>Fondrevelle, Julien</e><e>Oulamara, Ammar</e><e>Portmann, Marie-Claude</e></author><title>Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach</title><booktitle>{International Conference on Industrial Engineering and Systems Management - IESM'05, Marrakech, Maroc}</booktitle><year>2005</year><month>Jan</month><note>Actes sur CD-Rom</note><keywords><e>flowshop</e><e>weighted sum of machine completion times</e><e>idle-time</e><e>minimal and maximal time lags</e><e>complexity</e><e>branch and bound</e></keywords><abstract>In this article, we consider flowshop scheduling problems with time lags constraints to minimize the weighted sum of machine completion times as objective function. Although this criterion has been addressed in few papers, it may be extremely important in practical situations. We present several complexity results and propose different approaches to solve the m-machine case.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004020 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 004020 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:fondrevelle05a
|texte= Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach
}}
| This area was generated with Dilib version V0.6.33. |  |