A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints

We consider the problem of scheduling a set of jobs subject to unequal release dates on a two-machine flow shop where the no-wait and non-availability constraints are considered so as to minimize the makespan. The contribution of this paper is two-fold. First, we propose a new mathematical formulati...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2018-01, Vol.6, p.16294-16304
Main Authors: Labidi, Mohamed, Kooli, Anis, Ladhari, Talel, Gharbi, Anis, Suryahatmaja, Umar S.
Format: Article
Language:English
Subjects:
Algorithms
Approximation algorithms
Availability
branch-and-bound algorithm
flow shop
Indexes
Job shop scheduling
Job shops
Lower bounds
no-wait
non-availability
Processor scheduling
Release dates
Schedules
Scheduling
Upper bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c408t-4da9d3f369c31a79fdfc28f1987f613037cc64277a8ab8e9e2fac17b64a792b33
cites cdi_FETCH-LOGICAL-c408t-4da9d3f369c31a79fdfc28f1987f613037cc64277a8ab8e9e2fac17b64a792b33
container_end_page 16304
container_issue
container_start_page 16294
container_title IEEE access
container_volume 6
creator Labidi, Mohamed
Kooli, Anis
Ladhari, Talel
Gharbi, Anis
Suryahatmaja, Umar S.
description We consider the problem of scheduling a set of jobs subject to unequal release dates on a two-machine flow shop where the no-wait and non-availability constraints are considered so as to minimize the makespan. The contribution of this paper is two-fold. First, we propose a new mathematical formulation for the problem and derive valid inequalities. Second, we propose new lower bounds that are based on single and two-machine relaxations. These lower bounds are embedded onto a branch-and-bound algorithm enhanced by elimination and dominance rules. Computational results show that our exact methods consistently outperform the state-of-the-art branch-and-bound procedure.
doi_str_mv 10.1109/ACCESS.2018.2815598
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8315022</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8315022</ieee_id><doaj_id>oai_doaj_org_article_30906c5a29634166813acdda1897f386</doaj_id><sourcerecordid>2455906374</sourcerecordid><originalsourceid>FETCH-LOGICAL-c408t-4da9d3f369c31a79fdfc28f1987f613037cc64277a8ab8e9e2fac17b64a792b33</originalsourceid><addsrcrecordid>eNpNkc1O3DAURiPUSiDgCdhYYp2pfxLHXo5SaJEorRoQS-vGsRmPMvFgO6B5ir5yTYNQvbF19X3Hlk9RXBC8IgTLL-u2veq6FcVErKggdS3FUXFCCZclqxn_9N_5uDiPcYvzEnlUNyfFnzVq_W4_J0jOTzCiLs3DAXmL0sag-1df_gC9cZNBd758BJfQ9ehfUbfxe9TpjRnm0U1P6Ffw_Wh2qJv7rdEJJY8eJvM8Z-BvMxqIBn2FZCKCacikqVy_gBuhd6NLh_yCKaYAbkrxrPhsYYzm_H0_LR6ur-7b7-Xtz2837fq21BUWqawGkAOzjEvNCDTSDlZTYYkUjeWEYdZozSvaNCCgF0YaakGTpudVDtOesdPiZuEOHrZqH9wOwkF5cOrfwIcnBSE5PRrFsMRc10AlZxXhXBAGehiACNlYJnhmXS6sffDPs4lJbf0c8mdGRausA3PWVDnFlpQOPsZg7MetBKs3kWoRqd5EqneRuXWxtJwx5qMhGKkxpewv0JWZzQ</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2455906374</pqid></control><display><type>article</type><title>A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints</title><source>IEEE Open Access Journals</source><creator>Labidi, Mohamed ; Kooli, Anis ; Ladhari, Talel ; Gharbi, Anis ; Suryahatmaja, Umar S.</creator><creatorcontrib>Labidi, Mohamed ; Kooli, Anis ; Ladhari, Talel ; Gharbi, Anis ; Suryahatmaja, Umar S.</creatorcontrib><description>We consider the problem of scheduling a set of jobs subject to unequal release dates on a two-machine flow shop where the no-wait and non-availability constraints are considered so as to minimize the makespan. The contribution of this paper is two-fold. First, we propose a new mathematical formulation for the problem and derive valid inequalities. Second, we propose new lower bounds that are based on single and two-machine relaxations. These lower bounds are embedded onto a branch-and-bound algorithm enhanced by elimination and dominance rules. Computational results show that our exact methods consistently outperform the state-of-the-art branch-and-bound procedure.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2018.2815598</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Approximation algorithms ; Availability ; branch-and-bound algorithm ; flow shop ; Indexes ; Job shop scheduling ; Job shops ; Lower bounds ; no-wait ; non-availability ; Processor scheduling ; Release dates ; Schedules ; Scheduling ; Upper bound</subject><ispartof>IEEE access, 2018-01, Vol.6, p.16294-16304</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c408t-4da9d3f369c31a79fdfc28f1987f613037cc64277a8ab8e9e2fac17b64a792b33</citedby><cites>FETCH-LOGICAL-c408t-4da9d3f369c31a79fdfc28f1987f613037cc64277a8ab8e9e2fac17b64a792b33</cites><orcidid>0000-0002-9585-1339</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8315022$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>315,786,790,27666,27957,27958,55284</link.rule.ids></links><search><creatorcontrib>Labidi, Mohamed</creatorcontrib><creatorcontrib>Kooli, Anis</creatorcontrib><creatorcontrib>Ladhari, Talel</creatorcontrib><creatorcontrib>Gharbi, Anis</creatorcontrib><creatorcontrib>Suryahatmaja, Umar S.</creatorcontrib><title>A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints</title><title>IEEE access</title><addtitle>Access</addtitle><description>We consider the problem of scheduling a set of jobs subject to unequal release dates on a two-machine flow shop where the no-wait and non-availability constraints are considered so as to minimize the makespan. The contribution of this paper is two-fold. First, we propose a new mathematical formulation for the problem and derive valid inequalities. Second, we propose new lower bounds that are based on single and two-machine relaxations. These lower bounds are embedded onto a branch-and-bound algorithm enhanced by elimination and dominance rules. Computational results show that our exact methods consistently outperform the state-of-the-art branch-and-bound procedure.</description><subject>Algorithms</subject><subject>Approximation algorithms</subject><subject>Availability</subject><subject>branch-and-bound algorithm</subject><subject>flow shop</subject><subject>Indexes</subject><subject>Job shop scheduling</subject><subject>Job shops</subject><subject>Lower bounds</subject><subject>no-wait</subject><subject>non-availability</subject><subject>Processor scheduling</subject><subject>Release dates</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Upper bound</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>DOA</sourceid><recordid>eNpNkc1O3DAURiPUSiDgCdhYYp2pfxLHXo5SaJEorRoQS-vGsRmPMvFgO6B5ir5yTYNQvbF19X3Hlk9RXBC8IgTLL-u2veq6FcVErKggdS3FUXFCCZclqxn_9N_5uDiPcYvzEnlUNyfFnzVq_W4_J0jOTzCiLs3DAXmL0sag-1df_gC9cZNBd758BJfQ9ehfUbfxe9TpjRnm0U1P6Ffw_Wh2qJv7rdEJJY8eJvM8Z-BvMxqIBn2FZCKCacikqVy_gBuhd6NLh_yCKaYAbkrxrPhsYYzm_H0_LR6ur-7b7-Xtz2837fq21BUWqawGkAOzjEvNCDTSDlZTYYkUjeWEYdZozSvaNCCgF0YaakGTpudVDtOesdPiZuEOHrZqH9wOwkF5cOrfwIcnBSE5PRrFsMRc10AlZxXhXBAGehiACNlYJnhmXS6sffDPs4lJbf0c8mdGRausA3PWVDnFlpQOPsZg7MetBKs3kWoRqd5EqneRuXWxtJwx5qMhGKkxpewv0JWZzQ</recordid><startdate>20180101</startdate><enddate>20180101</enddate><creator>Labidi, Mohamed</creator><creator>Kooli, Anis</creator><creator>Ladhari, Talel</creator><creator>Gharbi, Anis</creator><creator>Suryahatmaja, Umar S.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-9585-1339</orcidid></search><sort><creationdate>20180101</creationdate><title>A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints</title><author>Labidi, Mohamed ; Kooli, Anis ; Ladhari, Talel ; Gharbi, Anis ; Suryahatmaja, Umar S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c408t-4da9d3f369c31a79fdfc28f1987f613037cc64277a8ab8e9e2fac17b64a792b33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Approximation algorithms</topic><topic>Availability</topic><topic>branch-and-bound algorithm</topic><topic>flow shop</topic><topic>Indexes</topic><topic>Job shop scheduling</topic><topic>Job shops</topic><topic>Lower bounds</topic><topic>no-wait</topic><topic>non-availability</topic><topic>Processor scheduling</topic><topic>Release dates</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Upper bound</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Labidi, Mohamed</creatorcontrib><creatorcontrib>Kooli, Anis</creatorcontrib><creatorcontrib>Ladhari, Talel</creatorcontrib><creatorcontrib>Gharbi, Anis</creatorcontrib><creatorcontrib>Suryahatmaja, Umar S.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Labidi, Mohamed</au><au>Kooli, Anis</au><au>Ladhari, Talel</au><au>Gharbi, Anis</au><au>Suryahatmaja, Umar S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2018-01-01</date><risdate>2018</risdate><volume>6</volume><spage>16294</spage><epage>16304</epage><pages>16294-16304</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>We consider the problem of scheduling a set of jobs subject to unequal release dates on a two-machine flow shop where the no-wait and non-availability constraints are considered so as to minimize the makespan. The contribution of this paper is two-fold. First, we propose a new mathematical formulation for the problem and derive valid inequalities. Second, we propose new lower bounds that are based on single and two-machine relaxations. These lower bounds are embedded onto a branch-and-bound algorithm enhanced by elimination and dominance rules. Computational results show that our exact methods consistently outperform the state-of-the-art branch-and-bound procedure.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2018.2815598</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0002-9585-1339</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2169-3536
ispartof IEEE access, 2018-01, Vol.6, p.16294-16304
issn 2169-3536
2169-3536
language eng
recordid cdi_ieee_primary_8315022
source IEEE Open Access Journals
subjects Algorithms
Approximation algorithms
Availability
branch-and-bound algorithm
flow shop
Indexes
Job shop scheduling
Job shops
Lower bounds
no-wait
non-availability
Processor scheduling
Release dates
Schedules
Scheduling
Upper bound
title A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-23T02%3A27%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Computational%20Study%20of%20the%20Two-Machine%20No-Wait%20Flow%20Shop%20Scheduling%20Problem%20Subject%20to%20Unequal%20Release%20Dates%20and%20Non-Availability%20Constraints&rft.jtitle=IEEE%20access&rft.au=Labidi,%20Mohamed&rft.date=2018-01-01&rft.volume=6&rft.spage=16294&rft.epage=16304&rft.pages=16294-16304&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2018.2815598&rft_dat=%3Cproquest_ieee_%3E2455906374%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c408t-4da9d3f369c31a79fdfc28f1987f613037cc64277a8ab8e9e2fac17b64a792b33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2455906374&rft_id=info:pmid/&rft_ieee_id=8315022&rfr_iscdi=true