Original Article

The International Journal of Advanced Manufacturing Technology

, Volume 48, Issue 5, pp 719-723

First online:

Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan

  • Ji-Bo WangAffiliated withSchool of Science, Shenyang Institute of Aeronautical Engineering Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we consider an n-job, m-machine flow shop scheduling problem with deteriorating jobs. By deteriorating jobs, we mean jobs whose processing times are an increasing function of their execution starting time. A simple linear deterioration function is assumed. When some dominant relationships between m − 1 machines can be satisfied, we show that the makespan minimization problem can be solved in polynomial time.


Scheduling Flow shop Simple linear deterioration Makespan Dominating machines