A framework for dynamic dispatch decision-making applied in transportation scheduling Online publication date: Sun, 11-Jan-2015
by Sundaravalli Narayanaswami; Narayan Rangaraj
International Journal of Operational Research (IJOR), Vol. 15, No. 4, 2012
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook