Two-stage flexible flow shop scheduling subject to fixed job sequences

F. J. Hwang*, Miao-Tsong Lin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n l jobs per type l∈1,..., m are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m 2 Π l=1 m n l 2) dynamic programming algorithm coupled with numerical experiments is presented.

Original languageEnglish
Pages (from-to)506-515
Number of pages10
JournalJournal of the Operational Research Society
Issue number3
StatePublished - Mar 2016


  • dedicated machines
  • dynamic programming
  • fixed job sequences
  • regular objective functions
  • two-stage flexible flow shop


Dive into the research topics of 'Two-stage flexible flow shop scheduling subject to fixed job sequences'. Together they form a unique fingerprint.

Cite this