Skip to main content

2019 | OriginalPaper | Buchkapitel

14. Routing and Scheduling

verfasst von : Dmitry Ivanov, Alexander Tsipoulanidis, Jörn Schönberger

Erschienen in: Global Supply Chain and Operations Management

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Agnetis A, Hall NG, Pacciarelli D (2006) Supply chain scheduling: sequence coordination. Discret Appl Math 154(15):2044–2063CrossRef Agnetis A, Hall NG, Pacciarelli D (2006) Supply chain scheduling: sequence coordination. Discret Appl Math 154(15):2044–2063CrossRef
Zurück zum Zitat Albers S (1997) Better bounds for online scheduling. SIAM J Comput 29(2):459–473CrossRef Albers S (1997) Better bounds for online scheduling. SIAM J Comput 29(2):459–473CrossRef
Zurück zum Zitat 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–1536CrossRef 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–1536CrossRef
Zurück zum Zitat Artigues C, Billaut J-C, Esswein C (2005) Maximization of solution flexibility for robust shop scheduling. Eur J Oper Res 165(2):314–328CrossRef Artigues C, Billaut J-C, Esswein C (2005) Maximization of solution flexibility for robust shop scheduling. Eur J Oper Res 165(2):314–328CrossRef
Zurück zum Zitat 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–100CrossRef 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–100CrossRef
Zurück zum Zitat 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–2310CrossRef 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–2310CrossRef
Zurück zum Zitat Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J (2001) Scheduling computer and manufacturing processes, 2nd edn. Springer, BerlinCrossRef Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J (2001) Scheduling computer and manufacturing processes, 2nd edn. Springer, BerlinCrossRef
Zurück zum Zitat Bożek A, Wysocki M (2015) Flexible job shop with continuous material flow. Int J Prod Res 53(4):1273–1290CrossRef Bożek A, Wysocki M (2015) Flexible job shop with continuous material flow. Int J Prod Res 53(4):1273–1290CrossRef
Zurück zum Zitat Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130–148CrossRef Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130–148CrossRef
Zurück zum Zitat Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581CrossRef Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581CrossRef
Zurück zum Zitat Croes G (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812CrossRef Croes G (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812CrossRef
Zurück zum Zitat Desrochers M, Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper Res Lett 10:27–36CrossRef Desrochers M, Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper Res Lett 10:27–36CrossRef
Zurück zum Zitat Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271CrossRef Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271CrossRef
Zurück zum Zitat 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–3048CrossRef 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–3048CrossRef
Zurück zum Zitat Dolgui A, Proth J-M (2010) Supply chain engineering: useful methods and techniques. Springer, BerlinCrossRef Dolgui A, Proth J-M (2010) Supply chain engineering: useful methods and techniques. Springer, BerlinCrossRef
Zurück zum Zitat Dolgui A, Eremeev AV, Kovalyov MY, Kuznetsov PM (2010) Multi-product lot-sizing and scheduling on unrelated parallel machines. IIE Trans 42(7):514–524CrossRef Dolgui A, Eremeev AV, Kovalyov MY, Kuznetsov PM (2010) Multi-product lot-sizing and scheduling on unrelated parallel machines. IIE Trans 42(7):514–524CrossRef
Zurück zum Zitat 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–154CrossRef 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–154CrossRef
Zurück zum Zitat Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22(2):340–349CrossRef Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22(2):340–349CrossRef
Zurück zum Zitat 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–5141CrossRef 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–5141CrossRef
Zurück zum Zitat Grünert T, Irnich S (2005) Optimierung im transport - band I: grundlagen. Shaker, Aachen Grünert T, Irnich S (2005) Optimierung im transport - band I: grundlagen. Shaker, Aachen
Zurück zum Zitat 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–193CrossRef 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–193CrossRef
Zurück zum Zitat 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–643CrossRef 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–643CrossRef
Zurück zum Zitat Ivanov D, Sokolov B (2012) Dynamic supply chain scheduling. J Sched 15(2):201–216CrossRef Ivanov D, Sokolov B (2012) Dynamic supply chain scheduling. J Sched 15(2):201–216CrossRef
Zurück zum Zitat 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–402CrossRef 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–402CrossRef
Zurück zum Zitat Ivanov D, Dolgui A, Sokolov B (2016b) Robust dynamic schedule coordination control in the supply chain. Comput Ind Eng 94(1):18–31CrossRef Ivanov D, Dolgui A, Sokolov B (2016b) Robust dynamic schedule coordination control in the supply chain. Comput Ind Eng 94(1):18–31CrossRef
Zurück zum Zitat Joereßen A, Sebastian H-J (1998) Problemlösung mit Modellen und Algorithmen. Teubner, StuttgartCrossRef Joereßen A, Sebastian H-J (1998) Problemlösung mit Modellen und Algorithmen. Teubner, StuttgartCrossRef
Zurück zum Zitat Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–68CrossRef Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–68CrossRef
Zurück zum Zitat 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–228CrossRef 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–228CrossRef
Zurück zum Zitat Kovalyov MY, Ng CT, Cheng TCE (2007) Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur J Oper Res 178:331–342CrossRef Kovalyov MY, Ng CT, Cheng TCE (2007) Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur J Oper Res 178:331–342CrossRef
Zurück zum Zitat Kyparisis GJ, Koulamas CP (2006) Flexible flow shop scheduling with uniform parallel machines. Eur J Oper Res 168:985–997CrossRef Kyparisis GJ, Koulamas CP (2006) Flexible flow shop scheduling with uniform parallel machines. Eur J Oper Res 168:985–997CrossRef
Zurück zum Zitat 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–368CrossRef 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–368CrossRef
Zurück zum Zitat Liu Z, Ro YK (2014) Rescheduling for machine disruption to minimize makespan and maximum lateness. J Sched 17(4):339–352CrossRef Liu Z, Ro YK (2014) Rescheduling for machine disruption to minimize makespan and maximum lateness. J Sched 17(4):339–352CrossRef
Zurück zum Zitat 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–79CrossRef 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–79CrossRef
Zurück zum Zitat Mattfeld DC (1996) Evolutionary search and the job shop. Physica-Verlag, HeidelbergCrossRef Mattfeld DC (1996) Evolutionary search and the job shop. Physica-Verlag, HeidelbergCrossRef
Zurück zum Zitat Moore JM (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15(1):102–109CrossRef Moore JM (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15(1):102–109CrossRef
Zurück zum Zitat Pinedo ML (2010) Theory, algorithms, and systems, 4th edn. Springer, New York Pinedo ML (2010) Theory, algorithms, and systems, 4th edn. Springer, New York
Zurück zum Zitat Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215–231CrossRef Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215–231CrossRef
Zurück zum Zitat 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–7022CrossRef 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–7022CrossRef
Zurück zum Zitat Shah N (2004) Process industry supply chains: advances and challenges. Comput Aided Chem Eng 18:123–138CrossRef Shah N (2004) Process industry supply chains: advances and challenges. Comput Aided Chem Eng 18:123–138CrossRef
Zurück zum Zitat Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 5(2):254–265CrossRef Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 5(2):254–265CrossRef
Zurück zum Zitat Sotskov YN, Lai T-C, Werner F (2013) Measures of problem uncertainty for scheduling with interval processing times. OR Spectr 35(3):659–689CrossRef Sotskov YN, Lai T-C, Werner F (2013) Measures of problem uncertainty for scheduling with interval processing times. OR Spectr 35(3):659–689CrossRef
Zurück zum Zitat Thonemann U (2010) Operations management: konzepte, methoden und anwendungen, 2nd edn. Pearson, München Thonemann U (2010) Operations management: konzepte, methoden und anwendungen, 2nd edn. Pearson, München
Zurück zum Zitat Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret Appl Math 123(1–3):487–512CrossRef Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret Appl Math 123(1–3):487–512CrossRef
Zurück zum Zitat Van de Vonder S, Demeulemeester E, Herroelen W (2007) A classification of predictive-reactive project scheduling procedures. J Sched 10(3):195–207CrossRef Van de Vonder S, Demeulemeester E, Herroelen W (2007) A classification of predictive-reactive project scheduling procedures. J Sched 10(3):195–207CrossRef
Zurück zum Zitat Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies and methods. J Sched 6(1):35–58CrossRef Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies and methods. J Sched 6(1):35–58CrossRef
Zurück zum Zitat 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 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
Metadaten
Titel
Routing and Scheduling
verfasst von
Dmitry Ivanov
Alexander Tsipoulanidis
Jörn Schönberger
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-319-94313-8_14