Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6895150 | European Journal of Operational Research | 2018 | 32 Pages |
Abstract
This paper tackles the makespan minimization for the well known two-machine flow shop problem. Several optimality conditions are discussed aiming at the characterization of a large set of optimal solutions. We show that our approach dominates some of the results found in the literature. We also establish a number of necessary optimality conditions and discuss the asymptotic behavior of the optimal makespan when the number of jobs goes to infinity.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Hatem Hadda, Najoua Dridi, Mohamed Karim Hajji,