Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence

Bertrand M.T. Lin, F. J. Hwang*, Jatinder N.D. Gupta

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


This paper studies the problem of scheduling three-operation jobs in a two-machine flowshop subject to a predetermined job processing sequence. Each job has two preassigned operations, which are to be performed on their respective dedicated machines, and a flexible operation, which may be processed on either of the two machines subject to the processing order as specified. Five standard objective functions, including the makespan, the maximum lateness, the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs are considered. We show that the studied problem for either of the five considered objective functions is ordinary NP-hard, even if the processing times of the preassigned operations are zero for all jobs. A pseudo-polynomial time dynamic programming framework, coupled with brief numerical experiments, is then developed for all the addressed performance metrics with different run times.

Original languageEnglish
Pages (from-to)293-302
Number of pages10
JournalJournal of Scheduling
Issue number3
StatePublished - Jun 2017


  • Dynamic program
  • Fixed job sequence
  • Flowshop
  • NP-hardness
  • Three-operation job

Fingerprint Dive into the research topics of 'Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence'. Together they form a unique fingerprint.

Cite this