A NEW BRANCH AND BOUND ALGORITHM FOR MINIMIZING MEAN TARDINESS IN 2-MACHINE FLOWSHOPS
We consider the two-machine flowshop scheduling problem with the objective of minimizing mean tardiness. Presented are several properties that are used to calculate lower bounds on total tardiness of jobs for a given partial sequence and to identify sequences dominated by others. We develop a branch and bound algorithm using these bounds and dominance rule. This algorithm is compared with an existing algorithm on randomly-generated test problems.
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Issue Date
- 1993-05
- Language
- English
- Article Type
- Article
- Keywords
SCHEDULING PROBLEM
- Citation
COMPUTERS OPERATIONS RESEARCH, v.20, no.4, pp.391 - 401
- ISSN
- 0305-0548
- 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 69 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.