Skip to main content
SpringerLink
Log in

Single-machine scheduling problems with release time of jobs depending on resource allocated

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

Abstract

This paper considers the single-machine scheduling problems with learning effect and deteriorating jobs. Release time of jobs is a positive and strictly decreasing function about resource consumption. The optimal algorithm is presented for the problem to minimize the makespan with the total resource consumption constraints. Then, for a given sequence, we propose an optimal solution for the problem to minimize the total resource consumption with the makespan constraints.

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.

Similar content being viewed by others

References

  1. Alidaee B, Womer N-K (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. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387–393

    Article  Google Scholar 

  4. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498

    Article  MATH  Google Scholar 

  5. Mosheiov G (1991) V-shaped policies for scheduling deteriorating jobs. Oper Res 39:979–991

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  MATH  Google Scholar 

  10. Gawiejnowicz S (2008) Time-dependent scheduling. Springer, New York

    MATH  Google Scholar 

  11. Gao W-J, Huang X, Wang J-B (2010) Single-machine scheduling with precedence constraints and decreasing start-time dependent processing times. Int J Adv Manuf Technol 46:291–299. doi:10.1007/s00170-009-2089-5

    Article  Google Scholar 

  12. 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. doi:10.1007/s00170-009-2089-5

    Article  Google Scholar 

  13. Wang J-B, Wang L-Y, Wang D, Wang X-Y (2008) Single machine scheduling with a time-dependent deterioration. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1760-6

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

    Article  Google Scholar 

  15. Zhang X-G, Yan G-L, Huang W-Z, Tang G-C (2011) Single-machine scheduling problems with time-dependent and position-dependent learning effects. Ann Oper Res. doi:10.1007/s10479-011-0835-1

  16. Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178

    Article  MATH  Google Scholar 

  17. Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curvess. Eur J Oper Res 147:665–670

    Article  MathSciNet  MATH  Google Scholar 

  18. Mosheiov G,Sidney JB (2005) Note on scheduling with general learning curves to minimize the number of tardy jobs. J Oper Res Soc 56:110–112

    Article  MATH  Google Scholar 

  19. Cheng M-B, Sun S-J, Yu Y (2007) A note on flow shop scheduling problems with a learning effect on no-idle dominant machines. Appl Math Comput 184:945–949

    Article  MathSciNet  MATH  Google Scholar 

  20. Biskup D (2008) A state-of-the-art review on scheduling with learning effect. Eur J Oper Res 188:315–329

    Article  MathSciNet  MATH  Google Scholar 

  21. Wang J-B (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35:397–402

    Article  Google Scholar 

  22. Lee W-C (2004) A note on deteriorating jobs and learning in single-machine scheduling problems. Int J Bus Econ 3:83–89

    Google Scholar 

  23. Wang J-B, Cheng TCE (2007) Scheduling problems with the effects of deterioration and learning. Asia-Pac J Oper Res 24:245–261

    Article  MathSciNet  Google Scholar 

  24. Wang X, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178:57–70

    Article  MathSciNet  MATH  Google Scholar 

  25. 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. doi:10.1007/s00170-008-1512-7

    Article  Google Scholar 

  26. Yang DL, Kuo WH (2010) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 58:25–28

    Article  Google Scholar 

  27. Blazewicz J, Ecker KH, Pesch E, Schmidt G, Weglarz J (2001) Scheduling computer and manufacturing processes. Springer, Berlin

    MATH  Google Scholar 

  28. Cheng TCE, Janiak A (1994) Resource optimal control in some single machine scheduling problem. IEEE Trans Automat Contr 39:1243–1246

    Article  MathSciNet  MATH  Google Scholar 

  29. Janiak A (1986) Time-optimal control in a single machine problem with resource constraints. Automatica 22:745–747

    Article  MATH  Google Scholar 

  30. Bachman A, Janiak A (2000) Scheduling deteriorating jobs dependent on resources for the makespan minimization. In: Operations research proceedings 2000: selected papers of the symposium on operations research (OR 2000), Dresden. pp 29–34

  31. Zhao C-L, Tang H-Y (2005) Single machine scheduling problems with deteriorating jobs. Appl Math Comput 161:865–874

    Article  MathSciNet  MATH  Google Scholar 

  32. Zhu Valerie C-Y, Sun L-Y, Sun L-H, Li X-H (2010) Single-machine scheduling time-dependent jobs with resource-dependent ready times. Comput Ind Eng 58:84–87

    Google Scholar 

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

  34. Wang J-B (2006) A note on scheduling problems with learning effect and deteriorating jobs. Int J Syst Sci 37:827–833

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics Science, Chongqing Normal University, Chongqing, 400047, People’s Republic of China

    Xin-Gong Zhang

  2. Business School, University of Shanghai for Science and Technology, Shanghai, 200093, People’s Republic of China

    Guang-Le Yan

  3. Managerial Engineering Institute, Shanghai Second Polytechnic University, Shanghai, 201209, People’s Republic of China

    Guo-Chun Tang

Authors
  1. Xin-Gong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guang-Le Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guo-Chun Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xin-Gong Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, XG., Yan, GL. & Tang, GC. Single-machine scheduling problems with release time of jobs depending on resource allocated. Int J Adv Manuf Technol 57, 1175–1181 (2011). https://doi.org/10.1007/s00170-011-3335-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation