Skip to main content
SpringerLink
Log in

Routing and Scheduling

  • Chapter
  • First Online:
Global Supply Chain and Operations Management

Part of the book series: Springer Texts in Business and Economics ((STBE))

  • 151k Accesses

Abstract

In this chapter, scheduling and routing principles are discussed. At the beginning, a typical case for operative decision making and mathematical graphs for the representation of decision situations in a network structure are introduced. Additionally, first insights into the algorithmic processing of graph-data as the basic ingredient for decision making in network structures are provided. The consideration of complex restrictions during the deployment of a resource is discussed by means of the traveling salesman problem (TSP), in which the sequencing of operations to build a schedule for a resource is the focus of decision making. The integrated consideration of assignment and scheduling/sequencing decision problems under limited resource availability is addressed in the context of the capacitated vehicle routing problem (CVRP). Finally, a short introduction to the scheduling of production machines is given. The chapter is completed by an E-Supplement providing additional case studies, Excel templates, tasks and video streams.

Find additional case-studies, Excel spreadsheet templates, and video streams in the E-Supplement to this book on www.global-supply-chain-management.de!

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

Bibliography

  • Agnetis A, Hall NG, Pacciarelli D (2006) Supply chain scheduling: sequence coordination. Discret Appl Math 154(15):2044–2063

    Article  Google Scholar 

  • Albers S (1997) Better bounds for online scheduling. SIAM J Comput 29(2):459–473

    Article  Google Scholar 

  • Andersson A, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37:1515–1536

    Article  Google Scholar 

  • Artigues C, Billaut J-C, Esswein C (2005) Maximization of solution flexibility for robust shop scheduling. Eur J Oper Res 165(2):314–328

    Article  Google Scholar 

  • Aytug H, Lawley MA, McKay K, Mohan S, Uzsoy R (2005) Executing production schedules in the face of uncertainties: a review and some future directions. Eur J Oper Res 161(1):86–100

    Article  Google Scholar 

  • Berrichi A, Yalaoui F (2013) Efficient bi-objective ant colony approach to minimize total tardiness and system unavailability for a parallel machine scheduling problem. Int J Adv Manuf Tech 68(9–12):2295–2310

    Article  Google Scholar 

  • Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J (2001) Scheduling computer and manufacturing processes, 2nd edn. Springer, Berlin

    Book  Google Scholar 

  • Bożek A, Wysocki M (2015) Flexible job shop with continuous material flow. Int J Prod Res 53(4):1273–1290

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581

    Article  Google Scholar 

  • Croes G (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812

    Article  Google Scholar 

  • Desrochers M, Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper Res Lett 10:27–36

    Article  Google Scholar 

  • Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271

    Article  Google Scholar 

  • Doerner KF, Gronalt M, Hartl RF, Kiechle G, Reimann M (2008) Exact and heuristic algorithms for the vehicle routing problem with multiple, interdependent time windows. Comput Oper Res 35:3034–3048

    Article  Google Scholar 

  • Dolgui A, Proth J-M (2010) Supply chain engineering: useful methods and techniques. Springer, Berlin

    Book  Google Scholar 

  • Dolgui A, Eremeev AV, Kovalyov MY, Kuznetsov PM (2010) Multi-product lot-sizing and scheduling on unrelated parallel machines. IIE Trans 42(7):514–524

    Article  Google Scholar 

  • Dolgui A, Ivanov D, Sethi SP, Sokolov B (2018) Scheduling in production, supply chain and industry 4.0 systems by optimal control. Int J Prod Res:1–22. https://doi.org/10.1080/00207543.2018.1442948

  • Gendreau M, Laporte G, Potvin J-Y (2002) Metaheuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, pp 129–154

    Chapter  Google Scholar 

  • Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22(2):340–349

    Article  Google Scholar 

  • Gomes MC, Barbosa-Póvoa AP, Novais AQ (2013) Reactive scheduling in a make-to-order flexible job shop with re-entrant process and assembly a mathematical programming approach. Int J Prod Res 51(17):5120–5141

    Article  Google Scholar 

  • Grünert T, Irnich S (2005) Optimierung im transport - band I: grundlagen. Shaker, Aachen

    Google Scholar 

  • Harjunkoski I, Maravelias CT, Bongers P, Castro PM, Engell S, Grossmann IE, Hooker J, Méndez C, Sand G, Wassick J (2014) Scope for industrial applications of production scheduling models and solution methods. Comput Chem Eng 62:161–193

    Article  Google Scholar 

  • Hazir O, Haouari M, Erel E (2010) Robust scheduling and robustness measures for the discrete time/cost trade-off problem. Eur J Oper Res 207(2):633–643

    Article  Google Scholar 

  • Ivanov D, Sokolov B (2012) Dynamic supply chain scheduling. J Sched 15(2):201–216

    Article  Google Scholar 

  • Ivanov D, Sokolov B, Dolgui A, Werner F, Ivanova M (2016a) A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0. Int J Prod Res 54(2):386–402

    Article  Google Scholar 

  • Ivanov D, Dolgui A, Sokolov B (2016b) Robust dynamic schedule coordination control in the supply chain. Comput Ind Eng 94(1):18–31

    Article  Google Scholar 

  • Ivanov D, Dolgui A, Sokolov B (2018) Scheduling of recovery actions in the supply chain with resilience analysis considerations. Int J Prod Res:1–18. https://doi.org/10.1080/00207543.2017.1401747

  • Joereßen A, Sebastian H-J (1998) Problemlösung mit Modellen und Algorithmen. Teubner, Stuttgart

    Book  Google Scholar 

  • Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–68

    Article  Google Scholar 

  • Kolisch R, Hess K (2000) Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints. Int J Prod Res 38(1):207–228

    Article  Google Scholar 

  • Kovalyov MY, Ng CT, Cheng TCE (2007) Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur J Oper Res 178:331–342

    Article  Google Scholar 

  • Kyparisis GJ, Koulamas CP (2006) Flexible flow shop scheduling with uniform parallel machines. Eur J Oper Res 168:985–997

    Article  Google Scholar 

  • Li Y, Chen R (2010) Stochastic single machine scheduling to minimize the weighted number of tardy jobs. In: Cao B-Y, Wang E, Guo S-Z, Chen S-L (eds) Fuzzy information and engineering 2010. Springer, Berlin, pp 363–368

    Chapter  Google Scholar 

  • Liu Z, Ro YK (2014) Rescheduling for machine disruption to minimize makespan and maximum lateness. J Sched 17(4):339–352

    Article  Google Scholar 

  • Maccarthy BL, Liu J (1993) Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. Int J Prod Res 31(1):59–79

    Article  Google Scholar 

  • Mattfeld DC (1996) Evolutionary search and the job shop. Physica-Verlag, Heidelberg

    Book  Google Scholar 

  • Moore JM (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15(1):102–109

    Article  Google Scholar 

  • Pinedo ML (2010) Theory, algorithms, and systems, 4th edn. Springer, New York

    Google Scholar 

  • Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215–231

    Article  Google Scholar 

  • Sawik T (2013) Integrated selection of suppliers and scheduling of customer orders in the presence of supply chain disruption risks. Int J Prod Res 51(23–24):7006–7022

    Article  Google Scholar 

  • Shah N (2004) Process industry supply chains: advances and challenges. Comput Aided Chem Eng 18:123–138

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 5(2):254–265

    Article  Google Scholar 

  • Sotskov YN, Lai T-C, Werner F (2013) Measures of problem uncertainty for scheduling with interval processing times. OR Spectr 35(3):659–689

    Article  Google Scholar 

  • Thonemann U (2010) Operations management: konzepte, methoden und anwendungen, 2nd edn. Pearson, München

    Google Scholar 

  • Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret Appl Math 123(1–3):487–512

    Article  Google Scholar 

  • Van de Vonder S, Demeulemeester E, Herroelen W (2007) A classification of predictive-reactive project scheduling procedures. J Sched 10(3):195–207

    Article  Google Scholar 

  • Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies and methods. J Sched 6(1):35–58

    Article  Google Scholar 

  • Werner F (2013) A survey of genetic algorithms for shop scheduling problems. In: Siarry P (ed) Heuristics: theory and applications. Nova Science, New York, pp 161–222

    Google Scholar 

References for Sect. 14.4.1

Download references

Author information

Authors and Affiliations

  1. Department of Business Administration, Berlin School of Economics and Law, Berlin, Germany

    Dmitry Ivanov & Alexander Tsipoulanidis

  2. Faculty of Transportation and Traffic Science “Friedrich List”, Technical University of Dresden, Dresden, Germany

    Jörn Schönberger

Authors
  1. Dmitry Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Tsipoulanidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jörn Schönberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ivanov, D., Tsipoulanidis, A., Schönberger, J. (2019). Routing and Scheduling. In: Global Supply Chain and Operations Management. Springer Texts in Business and Economics. Springer, Cham. https://doi.org/10.1007/978-3-319-94313-8_14

Download citation

Publish with us

Policies and ethics

Search

Navigation