You are not currently logged in.
Access JSTOR through your library or other institution:
Minimising Makespan in the Two-Machine Flow-Shop with Release Times
R. Tadei, J. N. D. Gupta, F. Della Croce and M. Cortesi
The Journal of the Operational Research Society
Vol. 49, No. 1 (Jan., 1998), pp. 77-85
Stable URL: http://www.jstor.org/stable/3010655
Page Count: 9
You can always find the topics here!Topics: Scheduling, Mathematical problems, Mathematical sequences, Optimal solutions, Operations research, Heuristics, Algorithms, Approximation, Sequencing
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper considers the two-machine flow-shop problem with the objective of minimising the makespan subject to different release times. In view of the strongly NP-hard nature of this problem, five lower bounds and two new dominance criteria are proposed together with a decomposition procedure that reduces the problem size by setting jobs at the beginning of the sequence. Several branch and bound procedures are described by applying different lower bounds and branching schemes. A detailed computational campaign has been performed on different kinds of instances testing problems with size up to 200 jobs.
The Journal of the Operational Research Society © 1998 Operational Research Society