Skip to main content

Some Single Machine Scheduling Problems with an Actual Time-Dependent and Position-Dependent Learning Effect

  • Conference paper
Fuzzy Information and Engineering

Part of the book series: Advances in Soft Computing ((AINSC,volume 54))

  • 1059 Accesses

Abstract

In this paper, we introduce an actual time-dependent and positiondependent learning effect into single-machine scheduling problems. The learning effect of a job is assumed to be a function of the sum of actual processing times of the jobs already processed and the job’s scheduled position. We show that under certain conditions, the problems with classical objectives such as make-span, sum of kth power of the completion times, total weighted completion time, maximum lateness and number of tardy jobs remain polynomial solvable.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biskup, D.: Single-machine scheduling with learning considerations. European Journal of Operational Research 115, 173–178 (1999)

    Article  MATH  Google Scholar 

  2. Biskup, D.: A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research 188, 315–329 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cheng, T.C.E., Wang, G.: Single machine scheduling with learning effect considerations. Annals of Operations Research 98, 273–290 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheng, T.C.E., Wu, C.C., Lee, W.C.: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Information Science 178, 2476–2487 (2008)

    Article  MathSciNet  Google Scholar 

  5. Koulamas, C., Kyparisis, G.J.: Single-machine and two-machine flowshop scheduling with general learning function. European Journal of Operational Research 178, 402–407 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kuo, W.H., Yang, D.L.: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research 174, 1184–1190 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kuo, W.H., Yang, D.L.: Single-machine scheduling problems with the time-dependent learning effect. Computers and Mathematics with Application 53, 1733–1739 (2007)

    Article  MathSciNet  Google Scholar 

  8. Lin, B.M.T.: Complexity results for single-machine scheduling with positional learning effects. Journal of Operational Research Society 58, 1099–1102 (2007)

    Article  MATH  Google Scholar 

  9. Moore, J.M.: An n job one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15, 102–109 (1968)

    Article  MATH  Google Scholar 

  10. Mosheiov, G.: Scheduling problems with learning effect. European Journal of Operational Research 132, 687–693 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Smith, W.E.: Various optimizers for single state production. Naval Research Logistics Quarterly 3, 59–66 (1956)

    Article  MathSciNet  Google Scholar 

  12. Townsend, W.: The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Management Science 24, 530–534 (1978)

    Article  MATH  Google Scholar 

  13. Wang, X., Cheng, T.C.E.: Single-machine scheduling with deteriorating jobs and learning effects to minimize the make-span. European Journal of Operational Research 178, 57–70 (2007)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  15. Wang, J.B., Ng, C.T., Cheng, T.C.E., Lin, L.L.: Single-machine scheduling with a time-dependent learning effect. International Journal of Production Economics 111, 802–811 (2008)

    Article  Google Scholar 

  16. Wang, J.B.: Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect. Computers and Industrial Engineering (2008) doi:10.1016 j.cie.2008.01.017

    Google Scholar 

  17. Wu, C.C., Lee, W.C.: Single machine scheduling problems with a learning effect. Applied Mathematical Modelling 32, 1191–1197 (2008)

    Article  MathSciNet  Google Scholar 

  18. Yang, D.L., Kuo, W.H.: Single-machine scheduling with an actual time-dependent learning effect. Journal of the Operational Research Society 58, 1348–1353 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, Kb., Li, Hx. (2009). Some Single Machine Scheduling Problems with an Actual Time-Dependent and Position-Dependent Learning Effect. In: Cao, By., Zhang, Cy., Li, Tf. (eds) Fuzzy Information and Engineering. Advances in Soft Computing, vol 54. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88914-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88914-4_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88913-7

  • Online ISBN: 978-3-540-88914-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics