Fuzzy Information and Engineering

, Volume 1, Issue 2, pp 161–177 | Cite as

Some single-machine scheduling problems with actual time and position dependent learning effects

Original Article
First Online:
Received:
Revised:
Accepted:
  • 38 Downloads

Abstract

In this paper we study some single-machine scheduling problems with learning effects where the actual processing time of a job serves as a function of the total actual processing times of the jobs already processed and of its scheduled position. We show by examples that the optimal schedules for the classical version of problems are not optimal under this actual time and position dependent learning effect model for the following objectives: makespan, sum of kth power of the completion times, total weighted completion times, maximum lateness and number of tardy jobs. But under certain conditions, we show that the shortest processing time (SPT) rule, the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and the modified Moore’s Algorithm can also construct an optimal schedule for the problem of minimizing these objective functions, respectively.

Keywords

Scheduling Actual time-dependent Position-dependent Learning effect Single-machine 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society 50:711–720MATHCrossRefGoogle Scholar
  2. 2.
    Badiru AB (1992) Computational survey of univariate and multivariate learning curve models. IEEE Transactions on Engineering Management 39:176–188CrossRefGoogle Scholar
  3. 3.
    Biskup D (1999) Single-machine scheduling with learning considerations. European Journal of Operational Research 115:173–178MATHCrossRefGoogle Scholar
  4. 4.
    Biskup D (2008) A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research 188:315–329MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research 152:1–13MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Cheng TCE, Wang G (2000) Single machine scheduling with learning effect considerations. Annals of Operations Research 98:273–290MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Cheng TCE, Wu CC, Lee WC (2008) Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Information Science 178:2476–2487CrossRefMathSciNetGoogle Scholar
  8. 8.
    Koulamas C, Kyparisis GJ (2007) Single-machine and two-machine flowshop scheduling with general learning function. European Journal of Operational Research 178:402–407MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kuo WH, Yang DL (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research 174:1184–1190MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kuo WH, Yang DL (2007) Single-machine scheduling problems with the time-dependent learning effect. Computers and Mathematics with Application 53:1733–1739MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Lee WC, Wu CC, Sung HJ (2004) A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica 40:303–315MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Lin BMT (2007) Complexity results for single-machine scheduling with positional learning effects. Journal of Operational Research Society 58:1099–1102MATHCrossRefGoogle Scholar
  13. 13.
    Moore JM (1968) An n job one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15:102–109MATHCrossRefGoogle Scholar
  14. 14.
    Mosheiov G (2001) Scheduling problems with learning effect. European Journal of Operational Research 132:687–693MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Smith WE (1956) Various optimizers for single state production. Naval Research Logistics Quarterly 3:59–66CrossRefMathSciNetGoogle Scholar
  16. 16.
    Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Management Science 24:530–534MATHCrossRefGoogle Scholar
  17. 17.
    Wang X, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research 178:57–70MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Wang JB (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35:397–402CrossRefGoogle Scholar
  19. 19.
    Wang JB (2008) Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect. Computers and Industrial Engineering 55:584–591CrossRefGoogle Scholar
  20. 20.
    Wang JB, Ng CT, Cheng TCE, Lin LL (2008) Single-machine scheduling with a time-dependent learning effect. International Journal of Production Economics 111:802–811CrossRefGoogle Scholar
  21. 21.
    Wu CC, Lee WC (2008) Single machine scheduling problems with a learning effect. Applied Mathematical Modelling 32:1191–1197CrossRefMathSciNetGoogle Scholar
  22. 22.
    Yelle LE (1979) The learning curve: Historical review and comprehensive survey. Decision Sciences 10:302–328CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH and Fuzzy Information and Engineering Branch of the Operations Research Society of China 2009

Authors and Affiliations

  1. 1.School of Electronic and Information EngineeringDalian University of TechnologyDalianP.R.China

Personalised recommendations