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.

A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times

S. R. Das, J. N. D. Gupta and B. M. Khumawala
The Journal of the Operational Research Society
Vol. 46, No. 11 (Nov., 1995), pp. 1365-1373
DOI: 10.2307/2584570
Stable URL: http://www.jstor.org/stable/2584570
Page Count: 9
  • Subscribe ($19.50)
  • Cite this Item
A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
Preview not available

Abstract

This paper considers the permutation flowshop scheduling problem with significant sequence dependent set-up times and develops a savings index heuristic algorithm to find an approximately minimum makespan schedule. The proposed algorithm determines the savings in time associated with a particular sequence and selects the sequence with the maximum time savings as the best heuristic solution. Computational experience indicating the effectiveness and efficiency of the proposed savings index heuristic algorithm are reported and discussed.

Page Thumbnails

  • Thumbnail: Page 
[1365]
    [1365]
  • Thumbnail: Page 
1366
    1366
  • Thumbnail: Page 
1367
    1367
  • Thumbnail: Page 
1368
    1368
  • Thumbnail: Page 
1369
    1369
  • Thumbnail: Page 
1370
    1370
  • Thumbnail: Page 
1371
    1371
  • Thumbnail: Page 
1372
    1372
  • Thumbnail: Page 
1373
    1373