No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates

No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates

In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumabl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research 2011, p.6273-6286
Hauptverfasser: Ben Chihaoui, Faten, Kacem, Imed, Hadj-Alouane, Atidel B., Dridi, Najoua, Rezg, Nidhal
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Modeling and Simulation
Operations Research
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 6286
container_issue
container_start_page 6273
container_title International journal of production research
container_volume
creator Ben Chihaoui, Faten
Kacem, Imed
Hadj-Alouane, Atidel B.
Dridi, Najoua
Rezg, Nidhal
description In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumable schedule that minimises the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.
doi_str_mv 10.1080/00207543.2010.531775
format Article
fullrecord <record><control><sourceid>hal</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_inria_00601430v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_inria_00601430v1</sourcerecordid><originalsourceid>FETCH-hal_primary_oai_HAL_inria_00601430v13</originalsourceid><addsrcrecordid>eNqVyrtOxDAQhWELgUS4vAHF9MiLvbm2CIG2QFQUdNGQTMiAM45s70ZLz3uzK_ECnOaXjj6lbqxZWdOYO2PWpi6LfLU2h6vMbV2XJyqzeVXpsmneTlV2JPpoztVFjJ_msLIpMvXz4vWCnCB2I_Vbx_IBfgCEtHg9YTeyEAzOLzqOfobkYWLhib8J0kgw4RfFGQW20lMA8aJxh-zwnR2nPXReYgrIkiKg9NDzMFAgSRDIEUaCHhPFK3U2oIt0_ddLdfv0-Pqw0SO6dg48Ydi3Hrnd3D-3LIGxNaYytsjNzub_07-PR1-3</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates</title><source>EBSCOhost Business Source Complete</source><source>Access via Taylor &amp; Francis</source><creator>Ben Chihaoui, Faten ; Kacem, Imed ; Hadj-Alouane, Atidel B. ; Dridi, Najoua ; Rezg, Nidhal</creator><creatorcontrib>Ben Chihaoui, Faten ; Kacem, Imed ; Hadj-Alouane, Atidel B. ; Dridi, Najoua ; Rezg, Nidhal</creatorcontrib><description>In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumable schedule that minimises the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207543.2010.531775</identifier><language>eng</language><publisher>Taylor &amp; Francis</publisher><subject>Computer Science ; Modeling and Simulation ; Operations Research</subject><ispartof>International journal of production research, 2011, p.6273-6286</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0001-6649-7257 ; 0000-0001-8365-3004 ; 0000-0001-6649-7257</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,4024,27923,27924,27925</link.rule.ids><backlink>$$Uhttps://inria.hal.science/inria-00601430$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Ben Chihaoui, Faten</creatorcontrib><creatorcontrib>Kacem, Imed</creatorcontrib><creatorcontrib>Hadj-Alouane, Atidel B.</creatorcontrib><creatorcontrib>Dridi, Najoua</creatorcontrib><creatorcontrib>Rezg, Nidhal</creatorcontrib><title>No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates</title><title>International journal of production research</title><description>In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumable schedule that minimises the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.</description><subject>Computer Science</subject><subject>Modeling and Simulation</subject><subject>Operations Research</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNqVyrtOxDAQhWELgUS4vAHF9MiLvbm2CIG2QFQUdNGQTMiAM45s70ZLz3uzK_ECnOaXjj6lbqxZWdOYO2PWpi6LfLU2h6vMbV2XJyqzeVXpsmneTlV2JPpoztVFjJ_msLIpMvXz4vWCnCB2I_Vbx_IBfgCEtHg9YTeyEAzOLzqOfobkYWLhib8J0kgw4RfFGQW20lMA8aJxh-zwnR2nPXReYgrIkiKg9NDzMFAgSRDIEUaCHhPFK3U2oIt0_ddLdfv0-Pqw0SO6dg48Ydi3Hrnd3D-3LIGxNaYytsjNzub_07-PR1-3</recordid><startdate>2011</startdate><enddate>2011</enddate><creator>Ben Chihaoui, Faten</creator><creator>Kacem, Imed</creator><creator>Hadj-Alouane, Atidel B.</creator><creator>Dridi, Najoua</creator><creator>Rezg, Nidhal</creator><general>Taylor &amp; Francis</general><scope>1XC</scope><orcidid>https://orcid.org/0000-0001-6649-7257</orcidid><orcidid>https://orcid.org/0000-0001-8365-3004</orcidid><orcidid>https://orcid.org/0000-0001-6649-7257</orcidid></search><sort><creationdate>2011</creationdate><title>No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates</title><author>Ben Chihaoui, Faten ; Kacem, Imed ; Hadj-Alouane, Atidel B. ; Dridi, Najoua ; Rezg, Nidhal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-hal_primary_oai_HAL_inria_00601430v13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Computer Science</topic><topic>Modeling and Simulation</topic><topic>Operations Research</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ben Chihaoui, Faten</creatorcontrib><creatorcontrib>Kacem, Imed</creatorcontrib><creatorcontrib>Hadj-Alouane, Atidel B.</creatorcontrib><creatorcontrib>Dridi, Najoua</creatorcontrib><creatorcontrib>Rezg, Nidhal</creatorcontrib><collection>Hyper Article en Ligne (HAL)</collection><jtitle>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ben Chihaoui, Faten</au><au>Kacem, Imed</au><au>Hadj-Alouane, Atidel B.</au><au>Dridi, Najoua</au><au>Rezg, Nidhal</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates</atitle><jtitle>International journal of production research</jtitle><date>2011</date><risdate>2011</risdate><spage>6273</spage><epage>6286</epage><pages>6273-6286</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><abstract>In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumable schedule that minimises the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.</abstract><pub>Taylor &amp; Francis</pub><doi>10.1080/00207543.2010.531775</doi><orcidid>https://orcid.org/0000-0001-6649-7257</orcidid><orcidid>https://orcid.org/0000-0001-8365-3004</orcidid><orcidid>https://orcid.org/0000-0001-6649-7257</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0020-7543
ispartof International journal of production research, 2011, p.6273-6286
issn 0020-7543
1366-588X
language eng
recordid cdi_hal_primary_oai_HAL_inria_00601430v1
source EBSCOhost Business Source Complete; Access via Taylor & Francis
subjects Computer Science
Modeling and Simulation
Operations Research
title No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T22%3A15%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=No-wait%20scheduling%20of%20a%20two-machine%20flow-shop%20to%20minimize%20the%20makespan%20under%20non-availability%20constraints%20and%20different%20release%20dates&rft.jtitle=International%20journal%20of%20production%20research&rft.au=Ben%20Chihaoui,%20Faten&rft.date=2011&rft.spage=6273&rft.epage=6286&rft.pages=6273-6286&rft.issn=0020-7543&rft.eissn=1366-588X&rft_id=info:doi/10.1080/00207543.2010.531775&rft_dat=%3Chal%3Eoai_HAL_inria_00601430v1%3C/hal%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true