Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Coordinating multi-location production and customer delivery

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

Abstract

We study two parallel machine scheduling problems with equal processing time jobs and delivery times and costs. The jobs are processed on machines which are located at different sites, and delivered to a customer by a single vehicle. The first objective considered is minimizing the sum of total weighted completion time and total vehicle delivery costs. The second objective considered is minimizing the sum of total tardiness and total vehicle delivery costs. We develop several interesting properties of an optimal scheduling and delivery policy, and show that both problems can be solved by reduction to the Shortest-Path problem in a corresponding network. The overall computational effort of both algorithms is O(n m2+m+1) (where n and m are the number of jobs and the number of machines, respectively) by the application of the Directed Acyclic Graph (DAG) method. We also discuss several special cases for which the overall computational effort can be significantly reduced.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Brucker P., Knust S.: Complex Scheduling, 1st edn. Springer-Verlag, Berlin (2006)

    MATH  Google Scholar 

  2. Chajakis E.D., Guignard M.: Scheduling deliveries in vehicles with multiple compartments. J. Glob. Optim. 26, 43–78 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen Z.-L.: Scheduling and common due date assignment with earliness and tardiness costs and batch delivery costs. Eur. J. Oper. Res. 93, 49–60 (1996)

    Article  MATH  Google Scholar 

  5. Chen Z.-L.: Integrated production and outbound distribution scheduling: reviews and extensions. Oper. Res. 58, 130–148 (2010)

    Article  MATH  Google Scholar 

  6. Cheng T.C.E., Gordon V.S., Kovalyov M.Y.: Single machine scheduling with batch deliveries. Eur. J. Oper. Res. 94, 277–283 (1996)

    Article  MATH  Google Scholar 

  7. Cormen T.H., Leiserson C.E., Rivest R.L.: Introduction to algorithm, 2nd edn. The MIT Press, Cambridge (2001)

    Google Scholar 

  8. Ganesharajah T., Hall N.G., Sriskandarajah C.: Design and operational issues in AGV-served manufacturing systems. Ann. Oper. Res. 76, 109–154 (1998)

    Article  MATH  Google Scholar 

  9. Geunes J., Pardalos P.M.: Supply chain optimization, 1st edn. Springer, Berlin (2005)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Hall N.G., Potts C.N.: The coordination of scheduling and batch deliveries. Ann. Oper. Res. 135, 41–64 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hall L.A., Shmoys D.B.: Jackson’s rule for single-machine scheduling: making a good heuristic better. Math. Oper. Res. 17, 22–35 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Herrmann J.W., Lee C-Y.: On scheduling to minimize earliness and tardiness and batch delivery costs with a common due date. Eur. J. Oper. Res. 70, 272–288 (1993)

    Article  MATH  Google Scholar 

  14. Hurnik J., Knust S.: Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Appl. Math. 112, 199–216 (2001)

    Article  MathSciNet  Google Scholar 

  15. Kim, E.-S., Oron, D.: Scheduling equal processing time jobs on a single machine with delivery times and costs (in submission)

  16. Kise H.: On an automated two-machine flowshop scheduling problem with infinite buffer. J. Oper. Res. Soc. Jpn. 34, 354–361 (1991)

    MathSciNet  MATH  Google Scholar 

  17. Knust, S.: Shop-scheduling problems with transportation. Ph.D. thesis, Department of Mathematics and Computer Science, University of Osnabrück (1999)

  18. Krumke S.O., Taudes A., Westphal S.: Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. Comput. Oper. Res. 38, 1103–1108 (2011)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Maggu P.L., Das G.: On sequencing problem with transportation of jobs. Pure Appl. Math. Sci. 12, 1–6 (1980)

    MathSciNet  MATH  Google Scholar 

  21. Mazdeh M.M., Shashaani S., Ashouri A., Hindi K.S.: Single-machine batch scheduling minimizing weighted flow times and delivery costs. Appl. Math. Model. 35, 563–570 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  22. Pardalos P.M., Tsitsiringos V.: Financial Engineering, Supply Chain and E-commerce, 1st edn. Springer, Berlin (2002)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  24. Stern H.I., Vitner G.: Scheduling parts in a combined production-transportation work cell. J. Oper. Res. Soc. 41, 625–632 (1990)

    MATH  Google Scholar 

  25. Wang X., Cheng T.C.E.: Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers. Int. J. Prod. Econ. 119, 199–206 (2009)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  27. Yu, W.: The two-machine flow shop problem with delays and the one-machine total tardiness problem. Ph.D. Dissertation, Eindhoven University of Technology (1996)

  28. Yuan J.A.: A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs. Eur. J. Oper. Res. 94, 203–205 (1996)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cass Business School, City University London, London, EC1Y 8TZ, UK

    Eun-Seok Kim

  2. Business School, The University of Sydney, Sydney, NSW, 2006, Australia

    Daniel Oron

Authors
  1. Eun-Seok Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Oron
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniel Oron.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, ES., Oron, D. Coordinating multi-location production and customer delivery. Optim Lett 7, 39–50 (2013). https://doi.org/10.1007/s11590-011-0392-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0392-1

Keywords

Search

Navigation