Skip to main content
SpringerLink
Log in

Advances in Scheduling Problems

  • Reference work entry
  • First Online:
Handbook of Combinatorial Optimization

  • 7410 Accesses

Abstract

This chapter reviews a research focus of scheduling in manufacturing facilities over the last decade. Manufacturing environment has a great influence on the processing times of jobs. The chapter reviews basic concept about past-sequence-dependent delivery times and covers recently results on scheduling with such constraint.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. A. Borodin, R. El-yaniv, Online Computation and Competitive Analysis (Cambridge University Press, Cambridge, 1998)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. P. Brucker, Scheduling Algorithms, 5th edn. (Springer, Berlin, 2006)

    Google Scholar 

  4. R.M. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. C. Koulamas, G.J. Kyparisis, Single-machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187, 1045–1049 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. C. Koulamas, G.J. Kyparisis, Single-machine scheduling problems with past-sequence-dependent delivery times. Int. J. Prod. Econ. 126, 264–266 (2010)

    Article  Google Scholar 

  7. M.Y. Kovalyov, W. Kubiak, A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. J. Heuristics 3, 287–297 (1998)

    Article  MATH  Google Scholar 

  8. M.Y. Kovalyov, W. Kubiak, A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Oper. Res. 47, 757–761 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. J.K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems. Ann. Discret. Math. 1, 343–362 (1977)

    Article  MathSciNet  Google Scholar 

  10. M. Liu, F. Zheng, C. Chu, Y. Xu, New results on single-machine scheduling; past-sequence-dependent delivery time. Theor. Comput. Sci. 438, 55–61 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. M. Liu, F. Zheng, C. Chu, Y. Xu, Single-machine scheduling with past-sequence-dependent delivery times and release times. Inf. Process. Lett. 112, 835–838 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  12. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, 2nd edn. (Prentice Hall, New York, 2005)

    Google Scholar 

  13. F.B. Sidney, Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Oper. Res. 23, 283–298 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Economics & Management, Tongji University, 200092, Shanghai, People’s Republic of China

    Ming Liu & Feifeng Zheng

Authors
  1. Ming Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feifeng Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Ming Liu or Feifeng Zheng .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Liu, M., Zheng, F. (2013). Advances in Scheduling Problems. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_77

Download citation

Publish with us

Policies and ethics

Search

Navigation