Skip to main content
SpringerLink
Log in

Scheduling jobs with simultaneous considerations of controllable processing times and learning effect

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

This paper considers a scheduling problem with general job-dependent learning curves and controllable processing times on a single machine. The objective is to determine the optimal compressions of the processing times and the optimal sequence of jobs so as to minimize some total cost functions, which consist of regular and non-regular functions and the processing time compressions. It shows that the problem can be solved by an assignment problem and thus can be solved in polynomial time. Some extensions of the problem are also given.

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. Pinedo M (2012) Scheduling: theory, algorithms and systems, 4th edn. Prentic Hall, Englewood Cliffs

    Book  MATH  Google Scholar 

  2. Shen XN, Zhang M, Fu JZ (2014) Multi-objective dynamic job shop scheduling: a survey and prospects. Int J Innov Comput Inf Control 10(6):2113–2126

    Google Scholar 

  3. Khalid MNA, Yusof UK (2015) Optimizing distributed production scheduling problem in flexible manufacturing system subjects to machine maintenance: A modified chemical reaction approach. Int J Innov Comput Inf Control 11(1):213–228

    Google Scholar 

  4. Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155(13):1643–1666

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Janiak A, Krysiak T, Trela R (2011) Scheduling problems with learning and ageing effects: a survey. Decis Mak Manuf Serv 5(1):19–36

    MathSciNet  MATH  Google Scholar 

  7. Wang JB, Wang MZ (2010) Single machine multiple common due dates scheduling with learning effects. Comput Math Appl 60(11):2998–3002

    Article  MathSciNet  MATH  Google Scholar 

  8. Wang JB, Wang C (2011) Single-machine due-window assignment problem with learning effect and deteriorating jobs. Appl Math Model 35(8):4017–4022

    Article  MathSciNet  MATH  Google Scholar 

  9. Wang JB, Liu L, Wang C (2013) Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs. Appl Math Model 37(18–19):8394–8400

    Article  MathSciNet  Google Scholar 

  10. Wang JJ, Zhang BH (2015) Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Comput Oper Res 58:24–31

    Article  MathSciNet  MATH  Google Scholar 

  11. Janiak A, Janiak W, Lichtenstein M (2007) Resource management in machine scheduling problems: a survey. Decis Mak Manuf Serv 1(1):59–89

    MathSciNet  MATH  Google Scholar 

  12. Yang DL, Lai CJ, Yang SJ (2014) Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. Int J Prod Econ 150(6):96–103

    Article  Google Scholar 

  13. Yin YQ, Cheng TCE, Wu CC, Cheng SR (2014) Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. J Oper Res Soc 65(1):1–13

    Article  Google Scholar 

  14. Chang TR, Lee HT, Yang DL, Yang SJ (2014) Unrelated-parallel machine scheduling with simultaneous considerations of resource-dependent processing times and rate-modifying activities. Int J Innov Comput Inf Control 10(4):1587–1600

    Google Scholar 

  15. Wang D, Wang MZ, Wang JB (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Comput Ind Eng 59(3):458–462

    Article  Google Scholar 

  16. Yin N, Wang XY (2011) Single-machine scheduling with controllable processing times and learning effect. Int J Adv Manuf Technol 54(5–8):743–748

    Article  Google Scholar 

  17. Lu YY, Li G, Wu YB, Ji P (2014) Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim Lett 8(1):113–127

    Article  MathSciNet  MATH  Google Scholar 

  18. Liu Y, Feng Z (2014) Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Comput Ind Eng 75:170–175

    Article  Google Scholar 

  19. Li G, Luo ML, Zhang WJ, Wang XY (2015) Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int J Prod Res 53(4):1228–1241

    Article  Google Scholar 

  20. Li XJ, Wang JJ, Wang XR (2015) Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times, Asia-Pac J Oper Res 32(3):1550033 (12 pages)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  24. Panwalker SS, Smith ML, Seidmann A (1982) Common due-date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30(2):391–399

    Article  MATH  Google Scholar 

  25. Adamopoulos GI, Pappis CP (1996) Single machine scheduling with flow allowances. J Oper Res Soc 47(10):1280–1285

    Article  MATH  Google Scholar 

  26. Seidmann A, Panwalkar SS, Smith ML (1981) Optimal assignment of due dates for a single processor scheduling problem. Int J Prod Res 19(4):393–399

    Article  Google Scholar 

  27. Kanet JJ (1981) Minimizing variation of flow time in single machine systems. Manag Sci 27(12):1453–1459

    Article  MATH  Google Scholar 

  28. Bagchi UB (1989) Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Oper Res 37(1):118–125

    Article  MathSciNet  MATH  Google Scholar 

  29. Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  30. Chand S, Chhajed D (1992) A single machine model for determination of optimal due dates and sequence. Oper Res 40(3):596–602

    Article  MathSciNet  MATH  Google Scholar 

  31. Dickman B, Wilamowsky Y, Epstein S (2001) Multiple common due dates. Naval Res Logist 48(4):293–298

    Article  MathSciNet  MATH  Google Scholar 

  32. Liman SD, Panwalkar SS, Thongmee S (1998) Common due window size and location determination in a single machine scheduling problem. J Oper Res Soc 49(9):1007–1010

    Article  MATH  Google Scholar 

  33. Mosheiov G, Oron D (2010) Job-dependent due-window assignment based on a common flow allowance. Found Comput Decis Sci 35:185–195

    MATH  Google Scholar 

  34. Mor B, Mosheiov G (2012) Scheduling a maintenance activity and due-window assignment based on common flow allowance. Int J Prod Econ 135(1):222–230

    Article  Google Scholar 

  35. Wang XR, Wang JB, Jin J, Ji P (2014) Single machine scheduling with truncated job-dependent learning effect. Optim Lett 8(2):669–677

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous referees for their helpful comments on earlier version of the article. The work described in this paper was partially supported by a grant from The Hong Kong Polytechnic University (Project G-YBFE) and the National Natural Science Foundation of China (Grant Nos. 61403260, 71471120 and U1433124). This work was also supported by the Humanistic Social Science Fund of the Education Department of Liaoning Province under Grant W2015316.

Author information

Authors and Affiliations

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

    Lin Li & Ji-Bo Wang

  2. School of Economics and Management, Shenyang Aerospace University, Shenyang, 110136, China

    Ping Yan

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

    Ping Ji & Ji-Bo Wang

Authors
  1. Lin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ping Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ping Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lin Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, L., Yan, P., Ji, P. et al. Scheduling jobs with simultaneous considerations of controllable processing times and learning effect. Neural Comput & Applic 29, 1155–1162 (2018). https://doi.org/10.1007/s00521-016-2638-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-016-2638-4

Keywords

Search

Navigation