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

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

Bibliographic Details
Main Authors: Mohamed Labidi, Anis Kooli, Talel Ladhari, Anis Gharbi, Umar S. Suryahatmaja
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Scheduling
flow shop
no-wait
non-availability
lower bounds
branch-and-bound algorithm
Online Access:https://ieeexplore.ieee.org/document/8315022/

Internet

https://ieeexplore.ieee.org/document/8315022/

Similar Items