Scheduling operations at system choke points with sequence-dependent delays and processing times
Transportation service facilities often form system choke points with service rendered to entities from multiple queues that require staging for processing. With an MIP model that accommodates sequence-dependent setup times and processing times, we demonstrate how scheduling can be improved relative to simple rules that impose equity (such as FIFO) or efficiency (such as fastest processing time). Using an efficient heuristic scheduler for problems of this type, we then demonstrate, with simulation, the benefits that can occur from employing the refined scheduling procedure at a series of choke points in a transportation system subject to highly variable seasonal traffic.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 47 (2011)
Issue (Month): 5 (September)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:47:y:2011:i:5:p:669-680. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.