A framework for dynamic dispatch decision-making applied in transportation scheduling

MaRDI QIDQ2627353zbMATH OpenFDO

Authors Sundaravalli Narayanaswami, Narayan Rangaraj

Publication date 31 May 2017

Published in International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dispatch decision makingdisruptionheuristic rankingjob shop schedulingrailway reschedulingrailwayssingle machine schedulingtransport scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Review text

Summary: Scheduling is the process of resource allocation to task demands; a schedule includes resource allocation times to specific tasks and sequences in which tasks are processed by resources to obtain certain performance objectives. Heuristic and computational means are employed to develop schedules. When a planned schedule gets disrupted, the same schedule and dispatch sequence may not still provide the intended objective. In this paper, we present a novel method for deciding dispatch sequence of disrupted tasks pertaining to job shop scheduling problems. Our approach is based on simple computations on dynamic system parameters at the disrupt instance. We describe our dispatch decision-making process and validate performance of our procedure in achieving the intended objective. We verify applicability of our method to real-life problems as in railway rescheduling. Performance evaluations with other comparable procedures, managerial insights and problem characteristics where our framework is employable are reported.

Recommendations

• Application of an iterative framework for real-time railway rescheduling
• The dynamic vehicle rescheduling problem
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• A survey of dynamic scheduling in manufacturing systems
• Dynamic transport scheduling under multiple resource constraints

Cited in

(9)

• An estimation of distribution algorithm for public transport driver scheduling
• Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems
• A dynamic day-ahead paratransit planning problem
• A Hierarchical Task Model for Dispatching in Computer-Assisted Demand-Responsive Paratransit Operation
• Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights
• Train scheduling on a unidirectional path
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• An application of discrete-event theory to truck dispatching
• Adaptive demand peak management in online transport process planning

This page was built for publication: A framework for dynamic dispatch decision-making applied in transportation scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2627353)