HEURISTICS FOR FLOWSHOP SCHEDULING PROBLEMS MINIMIZING MEAN TARDINESS
Several heuristics are presented for the flowshop scheduling problem with the objective of minimizing mean tardiness. We consider the cases in which job sequences on all machines are the same (permutation flowshop) and in which they may be different. For the former case, the various methods that have been devised for minimizing the makespan are modified for our objective, while the list scheduling algorithm is used for the latter case. These heuristics are tested and compared with each other on randomly-generated test problems.
- Publisher
- STOCKTON PRESS
- Issue Date
- 1993-01
- Language
- English
- Article Type
- Article
- Keywords
SHOP SEQUENCING PROBLEM; JOB-SHOP; DISPATCHING RULES; M-MACHINE; N-JOB; ALGORITHM; APPROXIMATION
- Citation
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.44, no.1, pp.19 - 28
- ISSN
- 0160-5682
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 95 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.