Flow shop-sequencing problem with synchronous transfers and makespan minimization


Soylu B., Kirca O., Azizoglu M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol.45, no.15, pp.3311-3331, 2007 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 45 Issue: 15
  • Publication Date: 2007
  • Doi Number: 10.1080/00207540600621672
  • Journal Name: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.3311-3331
  • Keywords: flow shops, scheduling, makespan, branch-and-bound, IN-PROCESS, HEURISTICS, MACHINE
  • Middle East Technical University Affiliated: Yes

Abstract

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.