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!
Description
Summary: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.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2815598