Skip to main content
SpringerLink
Log in

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

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–720

    MATH  Google Scholar 

  2. Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13

    Article  MATH  MathSciNet  Google Scholar 

  3. Wu C-C, Lee W-C, Shiau Y-R (2007) Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33:1237–1243

    Article  Google Scholar 

  4. Toksar MD, Guner E (2007) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol. doi:10.1007/s00170-007-1128-3

    Google Scholar 

  5. Lee W-C, Wu C-C, Liu H-C (2008) A note on single-machine makespan problem with general deteriorating function. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1421-9

    Google Scholar 

  6. Kononov A, Gawiejnowicz S (2001) NP-hard cases in scheduling deteriorating jobs on dedicated machines. J Oper Res Soc 52:708–717

    Article  MATH  Google Scholar 

  7. Mosheiov G (2002) Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl Math 117:195–209

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang J-B, Xia Z-Q (2006) Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34:327–336

    Article  MathSciNet  Google Scholar 

  9. Wang J-B, Ng CT, Cheng TCE, Liu L-L (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185–193

    Article  MATH  MathSciNet  Google Scholar 

  10. Wu C-C, Lee W-C (2006) Two-machine flowshop scheduling to minimize mean flow time under linear deterioration. Int J Prod Econ 103:572–584

    Article  Google Scholar 

  11. Lee W-C, Wu C-C, Wen C-C, Chung Y-H (2008) A two-machine flowshop makespan scheduling problem with deteriorating jobs. Comput Ind Eng 54(4):737–749

    Article  Google Scholar 

  12. Lee W-C, Wu C-C (2008) Multi-machine scheduling with deteriorating jobs and scheduled maintenance. Appl Math Model 32(3):362–373

    Article  MATH  MathSciNet  Google Scholar 

  13. Lee W-C, Wu C-C, Chung Y-H, Liu H-C (2008) Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates. Comput Oper Res. doi:10.1016/j.cor.2008.07.008

    Google Scholar 

  14. He C-C, Wu C-C, Lee W-C (2008) Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs. J Oper Res Soc. doi:10.1057/jors.2008.123

    Google Scholar 

  15. Wang J-B, Jiang Y, Wang G (2009) Single machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. Int J Adv Manuf Technol 41:1221–1226

    Article  Google Scholar 

  16. Wang L-Y, Wang J-B, Wang D, Yin N, Huang X, Feng E-M (2009) Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs. Int J Adv Manuf Technol. doi:10.1007/s00170-009-1950-x

    Google Scholar 

  17. Wang L-Y, Wang J-B, Gao W-J, Huang X, Feng E-M (2009) Two single-machine scheduling problems with the effects of deterioration and learning. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2145-1

    Google Scholar 

  18. Huang X, Wang J-B, Wang X-R (2009) A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2242-1

    Google Scholar 

  19. Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21:653–659

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, 110136, People’s Republic of China

    Ji-Bo Wang

Authors
  1. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji-Bo Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, JB. Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan. Int J Adv Manuf Technol 48, 719–723 (2010). https://doi.org/10.1007/s00170-009-2314-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2314-2

Keywords

Search

Navigation