Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your 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
DOI: 10.2307/3010655
Stable URL: http://www.jstor.org/stable/3010655
Page Count: 9
  • Subscribe ($19.50)
  • Cite this Item
Minimising Makespan in the Two-Machine Flow-Shop with Release Times
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[77]
    [77]
  • Thumbnail: Page 
78
    78
  • Thumbnail: Page 
79
    79
  • Thumbnail: Page 
80
    80
  • Thumbnail: Page 
81
    81
  • Thumbnail: Page 
82
    82
  • Thumbnail: Page 
83
    83
  • Thumbnail: Page 
84
    84
  • Thumbnail: Page 
85
    85