Two machine flow shop scheduling problem with weighted WIP costs

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


This paper considers two new machine flow shop scheduling problems where the objective is to minimize the total WIP (work-in-process) cost. In this type of problems, the unit time WIP cost increases or decreases as a job passes through a series of stages in the production process. We first introduce this relatively new class of flow shop scheduling problems. Then, we establish the complexity of several problems with different types of job restrictions and weighted cost characteristics. For some tractable cases, we propose optimal solution procedures. Finally, a heuristic is introduced for a class of problem instances, and we find upper bounds on the relative errors.

Original languageEnglish
Pages (from-to)472-486
Number of pages15
JournalComputers and Operations Research
Issue number2
StatePublished - Feb 2009


  • Computational complexity
  • Heuristic analysis
  • Two machine flow shop
  • WIP cost


Dive into the research topics of 'Two machine flow shop scheduling problem with weighted WIP costs'. Together they form a unique fingerprint.

Cite this