INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol.45, no.15, pp.3311-3331, 2007 (SCI-Expanded)
Article / Article
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Science Citation Index Expanded (SCI-EXPANDED), Scopus
flow shops, scheduling, makespan, branch-and-bound, IN-PROCESS, HEURISTICS, MACHINE
Middle East Technical University Affiliated:
This study considers a permutation flow shop-sequencing problem with synchronous transfers between stations. The objective is to minimize the makespan. It is shown that the problem is strongly NP-hard. A branch-and-bound algorithm together with several lower and upper bounding procedures are developed. The algorithm returns optimal solutions to moderate-sized problem instances in reasonable solution times.