Two-stage flowshop scheduling with a common second-stage machine

Ceyda Oǧuz, Bertrand M T Lin, Edwin Tai Chiu Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

36 Citations (Scopus)

Abstract

This article considers minimizing the makespan in a two-stage flowshop scheduling problem with a common second-stage machine. After introducing the problem, we show that it is Nn P-hard and give two special cases which are polynomially solvable. Next, we propose a heuristic algorithm and analyze its worst-case error bound. We then develop some lower bounds. Finally, we perform some computational experiments to test the average performance of the proposed heuristic.
Original languageEnglish
Pages (from-to)1169-1174
Number of pages6
JournalComputers and Operations Research
Volume24
Issue number12
Publication statusPublished - 1 Dec 1997

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this