The International Journal of Advanced Manufacturing Technology

, Volume 48, Issue 5, pp 719–723

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

Original Article

DOI: 10.1007/s00170-009-2314-2

Cite this article as:
Wang, JB. Int J Adv Manuf Technol (2010) 48: 719. doi:10.1007/s00170-009-2314-2


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.


SchedulingFlow shopSimple linear deteriorationMakespanDominating machines

Copyright information

© Springer-Verlag London Limited 2009

Authors and Affiliations

  1. 1.School of ScienceShenyang Institute of Aeronautical EngineeringShenyangPeople’s Republic of China