A New Branch-And-Bound Approach For The N/2/Flowshop/Alpha F+Beta C-Max Flowshop Scheduling Problem
- Pergamon-Elsevier Science Ltd
- Publication Type:
- Journal Article
- Computers & Operations Research, 1999, 26 (13), pp. 1293 - 1310
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
In this study, a special situation involving a computationally di$cult #owshop scheduling problem is discussed. The objective of this problem is to minimize a weighted combination of job #owtime and schedule makespan. An e$cient Branch-and-Bound approach is developed here to solve this problem. The primary reason for developing this Branch-and-Bound approach is that its results can usefully guide other heuristic techniques, such as simulated annealing, tabu search, and genetic algorithms, in "nding optimal or good quality solutions to larger sized problems. As evidence of the utility of the proposed approach, we present extensive computational results on random test problems. Our results compare favorably with previously developed algorithms in the literature.
Please use this identifier to cite or link to this item: