Skip to main content
SpringerLink
Log in

Online Scheduling on Two Parallel Machines with Release Times and Delivery Times

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8287))

  • 1242 Accesses

Abstract

We consider an online scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on two parallel machines, where preemption is not allowed and the number of jobs is unknown in advance. The characteristics of each job, i.e., processing time and delivery time, become known at its release time. Each job is delivered to the destination independently and immediately at its completion time on the machines. The objective is to minimize the time by which all jobs have been delivered. We present an online algorithm which has a competitive ratio of \((1+\sqrt{5})/2\approx 1.618\).

This work was supported by the National Nature Science Foundation of China (11101147,11371137).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Carlier, J.: Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research 29, 298–306 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, B., Vestjens, A.P.A.: Scheduling on identical machines: How good is LPT in an online setting? Operations Research Letters 21(4), 165–169 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Strong NP-completeness results: Motivation, examples and implications. Journal of the Association of Computer Machinery 25, 499–508 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gharbi, A., Haouari, M.: Minimizing makespan on parallel machines subject to release dates and delivery times. Journal of Scheduling 5, 329–355 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gharbi, A., Haouari, M.: An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Computers & Operations Research 34, 868–883 (2007)

    Article  MATH  Google Scholar 

  6. Grabowski, J., Nowicki, E., Zdrzalka, S.: A block approach for single-machine scheduling with release dates and due dates. European Journal of Operational Research 26, 278–285 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hall, L., Shmoys, D.: Approximation algorithms for constrained scheduling problems. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 134–139. IEEE Computer Society Press, New York (1989)

    Chapter  Google Scholar 

  8. Hall, L., Shmoys, D.: Jacksons rule for single-machine scheduling: Making a good heuristic better. Mathematics of Operations Research 17, 22–35 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Haouari, M., Gharbi, A.: Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails. Annals of Operations Research 129, 187–204 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hoogeveen, J.A., Vestjean, A.P.A.: A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM Journal on Discrete Mathematics 13, 56–63 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu, M., Chu, C., Xu, Y., Zheng, F.: An optimal online algorithm for single machine scheduling with bounded delivery times. European Journal of Operational Research 201(3), 693–700 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mastrolilli, M.: Efficient approximation schemes for scheduling problems with release dates and delivery times. Journal of Scheduling 6, 521–531 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Noga, J., Seiden, S.S.: An optimal online algorithm for scheduling two machines with release times. Theoretical Computer Science 268(1), 133–143 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Potts, C.N.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research 28, 1436–1441 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  15. Stougie, L., Vestjens, A.P.A.: Randomized on-line scheduling: How low can’t you go? Operations Research Letters 30(2), 89–96 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Tian, J., Fu, R., Yuan, J.: A best on-line algorithm for single machine scheduling with small delivery times. Theoretical Computer Science 393, 287–293 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Vestjens, A.P.A.: Online Machine Scheduling. Ph.D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1997)

    Google Scholar 

  18. Woeginger, G.J.: Heuristics for parallel machine scheduling with delivery times. Acta Informatica 31(6), 503–512 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, East China University of Science and Technology, Shanghai, People’s Republic of China, 200237

    Peihai Liu & Xiwen Lu

Authors
  1. Peihai Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiwen Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    Peter Widmayer

  2. State Key Lab for Manufacturing Systems Engineering, 710049, Xi’an, China

    Yinfeng Xu

  3. Department of Computer Science, Montana State University, 59717-3880, Bozeman, MT, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, P., Lu, X. (2013). Online Scheduling on Two Parallel Machines with Release Times and Delivery Times. In: Widmayer, P., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2013. Lecture Notes in Computer Science, vol 8287. Springer, Cham. https://doi.org/10.1007/978-3-319-03780-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03780-6_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03779-0

  • Online ISBN: 978-3-319-03780-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation