Skip to main content
SpringerLink
Log in

Scheduling with job delivery coordination on single machine

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This paper investigates a single machine scheduling problem with job delivery coordination, in which each job demands different amount of storage space during transportation. In this problem, a set of independent jobs from a customer must first be processed on a machine without preemption and then delivered by two homogeneous vehicles to the customer in batches. To minimize the makespan, we develop a best possible polynomial-time heuristic with a worst-case ratio of 2.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bernhard, K., Jens, V.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2008)

    MATH  Google Scholar 

  2. Chang, Y.C., Lee, C.Y.: Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158(2), 470–487 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, Z.L., Pundoor, G.: Integrated order scheduling and packing. Prod. Oper. Manag. 18(6), 672–692 (2009)

    Article  Google Scholar 

  4. Chen, Z.L.: Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58(1), 130–148 (2010)

    Article  MATH  Google Scholar 

  5. Dosa, G., Li, R., Han, X., Tuza, Z.: Tight absolute bound for first fit decreasing bin-packing: \(FFD (L)\le 11/9OPT (L)+ 6/9\). Theor. Comput. Sci. 510, 13–61 (2013)

    Article  MATH  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. He, Y., Zhong, W., Gu, H.: Improved algorithms for two single machine scheduling problems. Theor. Comput. Sci. 363(3), 257–265 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hu, J.L., Luo, T.B., Su, X.T., et al.: Machine scheduling with a maintenance interval and job delivery coordination. Optim. Lett. (2015). doi:10.1007/s11590-015-0939-7

    MATH  Google Scholar 

  10. Kim, E.S., Oron, D.: Coordinating multi-location production and customer delivery. Optim. Lett. 7(1), 39–50 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lee, C.Y., Chen, Z.L.: Machine scheduling with transportation considerations. J. Sched. 4(1), 3–24 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Liu, P., Lu, X.: An improved approximation algorithm for single machine scheduling with job delivery. Theor. Comput. Sci. 412(3), 270–274 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lu, L., Yuan, J., Zhang, L.: Single machine scheduling with release dates and job delivery to minimize the makespan. Theor. Comput. Sci. 393(1), 102–108 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Res. Logist. 41(4), 579–585 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhong, W., Dosa, G., Tan, Z.: On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182(3), 1057–1072 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank two anonymous referees for their valuable suggestions and insightful comments that have significantly improved the presentation of this paper. The work was partly supported by the National Natural Science Foundation of China (71472133) and the Natural Science Foundation of Jiangsu (BK20140762).

Author information

Authors and Affiliations

  1. Department of Operation Management, Sea Tide Investments Ltd., Port Perry, L9L1B5, Canada

    Dakui Jiang

  2. Department of Management Science and Engineering, Nanjing Audit University, Nanjing, 211815, China

    Jiayin Tan

Authors
  1. Dakui Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiayin Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dakui Jiang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, D., Tan, J. Scheduling with job delivery coordination on single machine. Optim Lett 12, 265–272 (2018). https://doi.org/10.1007/s11590-017-1139-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-017-1139-4

Keywords

Search

Navigation