Skip to main content
SpringerLink
Log in

Group scheduling with independent setup times, ready times, and deteriorating job processing times

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

Abstract

In this paper we investigate a single machine scheduling problem with deteriorating jobs and group technology assumption. By deteriorating jobs and group technology assumption, we mean that job processing times are simple linear functions of its starting times. The group setup times are assumed to be known and fixed. We attempt to minimize the makespan with ready times of the jobs. For a special case, we show that the problem can be solved in polynomial time when deterioration and group technology are considered simultaneously.

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  MathSciNet  MATH  Google Scholar 

  3. Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin

    MATH  Google Scholar 

  4. Cheng TCE, Kang LY, Ng CT (2005) Single machine due-date scheduling of jobs with decreasing start-time dependent processing times. Int Trans Oper Res 12:355–366

    Article  MathSciNet  MATH  Google Scholar 

  5. Cheng TCE, Kang LY, Ng CT (2007) Due-date assignment and parallel-machine scheduling with deteriorating jobs. J Oper Res Soc 58:1103–1108

    Article  MATH  Google Scholar 

  6. Wang J-B, Xia Z-Q (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63–69

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Wang J-B, Xia Z-Q (2006) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 57:220–226

    MATH  Google Scholar 

  9. Janiak A, Kovalyov MY (2006) Scheduling in a contaminated area: a model and polynomial algorithms. Eur J Oper Res 173:125–132

    Article  MathSciNet  MATH  Google Scholar 

  10. Gawiejnowicz S, Kurc W, Pankowska L (2006) Pareto and scalar bicriterion optimization in scheduling deteriorating jobs. Comput Oper Res 33:746–767

    Article  MathSciNet  MATH  Google Scholar 

  11. Gawiejnowicz S (2007) Scheduling deteriorating jobs subject to job or machine availability constraints. Eur J Oper Res 180:472–478

    Article  MATH  Google Scholar 

  12. Kang L, Ng CT (2007) A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. Int J Prod Econ 109:180–184

    Article  Google Scholar 

  13. Wang J-B (2007) Flow shop scheduling problems with decreasing linear deterioration under dominating machines. Comput Oper Res 34:2043–2058

    Article  MATH  Google Scholar 

  14. Wang J-B, Guo A-X, Shan F, Jiang B, Wang L-Y (2007) Single machine group scheduling under decreasing linear deterioration. J Appl Math Comput 24:283–293

    Article  MathSciNet  MATH  Google Scholar 

  15. 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 

  16. Wu C-C, Shiau Y-R, Lee W-C (2008) Single-machine group scheduling problems with deterioration consideration. Comput Oper Res 35:1652–1659

    Article  MATH  Google Scholar 

  17. Wu C-C, Lee W-C (2008) Single-machine group-scheduling problems with deteriorating setup times and job-processing times. Int J Prod Econ 115:128–133

    Article  Google Scholar 

  18. Wang J-B, Lin L, Shan F (2008) Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol 39:808–812

    Article  Google Scholar 

  19. Toksar MD, Guner E (2008) 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 38:801–808

    Article  Google Scholar 

  20. Toksari MD, Guner E (2009) Scheduling problems with the nonlinear effects of learning and deterioration. Int J Adv Manuf Technol 45:801–807

    Article  Google Scholar 

  21. 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 45:336–340

    Article  Google Scholar 

  22. Lee W-C, Wu C-C, Chung Y-H, Liu H-C (2009) Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates. Comput Oper Res 36:2111–2121

    Article  MATH  Google Scholar 

  23. 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 

  24. Wang J-B, Wang L-Y, Wang D, Wang X-Y (2009) Single machine scheduling with a time-dependent deterioration. Int J Adv Manuf Technol 43:805–809

    Article  Google Scholar 

  25. Yin N, Wang J-B, Wang D, Wang L-Y, Wang X-Y (2010) Deteriorating jobs and Learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int J Adv Manuf Technol 46:707–714

    Article  MathSciNet  Google Scholar 

  26. Wang L-Y, Wang J-B, Gao W-J, Huang X, Feng E-M (2010) Two single-machine scheduling problems with the effects of deterioration and learning. Int J Adv Manuf Technol 46:715–720

    Article  Google Scholar 

  27. Wang D, Wang J-B (2010) Single-machine scheduling with simple linear deterioration to minimize earliness penalties. Int J Adv Manuf Technol 46:285–290

    Article  Google Scholar 

  28. Huang X, Wang J-B, Wang X-R (2010) A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties. Int J Adv Manuf Technol 47:1225–1230

    Article  Google Scholar 

  29. Wang J-B (2010) Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan. Int J Adv Manuf Technol 48:719–723

    Article  Google Scholar 

  30. Wang J-B, Sun L (2010) Single-machine group scheduling with decreasing linear deterioration setup times and job processing times. Int J Adv Manuf Technol 49:765–772

    Article  Google Scholar 

  31. Bahalke U, Yolmeh AM, Shahanaghi K (2010) Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs. Int J Adv Manuf Technol 50:749–759

    Article  Google Scholar 

  32. Xu D, Yin N, Wang J-B (2011) Comments on “Deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times”. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3252-3

    Google Scholar 

  33. Shen P, Wei C-M, Wu Y-B (2011) A note on deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3400-9

    Google Scholar 

  34. Ozturkoglu Y, Bulfin RL (2011) A unique integer mathematical model for scheduling deteriorating jobs with rate-modifying activities on a single machine. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3303-9

    Google Scholar 

  35. Zhang X-G, Yan G-L, Tang G-C (2011) Single-machine scheduling problems with release time of jobs depending on resource allocated. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3335-1

    Google Scholar 

  36. Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43:395–406

    MATH  Google Scholar 

  37. Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43:692–703

    Article  MathSciNet  MATH  Google Scholar 

  38. Dessouky MM (1998) Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Comput Ind Eng 34(4):793–806

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  40. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Shenyang Aerospace University, Shenyang, 110136, China

    Ji-Bo Wang, Xue Huang & Yu-Bin Wu

  2. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China

    Ping Ji

Authors
  1. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xue Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu-Bin Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ping Ji
    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., Huang, X., Wu, YB. et al. Group scheduling with independent setup times, ready times, and deteriorating job processing times. Int J Adv Manuf Technol 60, 643–649 (2012). https://doi.org/10.1007/s00170-011-3639-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3639-1

Keywords

Search

Navigation