Abstract
This paper addresses time-critical routing on a given path under release dates and deadline restrictions, while the minimization of the total weighted completion time is pursued. Since there may be destinations with flexible picking area resources that enable a delivery of goods before the defined release date at no additional costs, the well-known Line-Traveling Repairman problem (Line-TRPTW) is extended into the Line-TRPeTW. The Line-TRPeTW has various practical applications, such as, for example, the tour planning of an inland container ship along a river or that of a vehicle along a coastline. Although the feasibility variant of the Line-TRPTW/Line-TRPeTW is known to be strongly \({\mathcal {NP}}\)-hard, a first practically applicable Branch&Bound procedure is generated. By making use of different dominance rules and lower bounds, a comprehensive computational study proves that instances comprising up to 200 requests and locations are solved to optimality in reasonable time. Moreover, the paper analyzes the complexity of the simpler variant with relaxed release dates at all customer locations. This relaxed variant provides tight lower bounds. Furthermore, the complexity analysis shows that the relaxed problem variant is binary \({\mathcal {NP}}\)-hard even if deadlines are ignored, but can be efficiently solved by a specific Dynamic Programming approach that runs in pseudo-polynomial time.
Similar content being viewed by others
References
Afrati, F., Cosmadakis, S., Papadimitriou, C., Papageorgiou, G., & Papakostantinou, N. (1986). The complexity of the traveling repairman problem. Theoretical Informatics and Applications, 20(1), 79–87.
Bock, S. (2010). Real-time control of freight forwarder transportation networks by integrating multimodal transports and multiple transshipments. European Journal of Operational Research, 200(3), 733–746.
Bock, S. (2015). Solving the traveling repairman problem on a line with general processing times and deadlines. European Journal of Operational Research, 244(3), 690–703.
Bock, S., & Klamroth, K. (2013). Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions. Journal of Scheduling, 16, 479–494.
Boysen, N., Emde, S., Hoeck, M., & Kauderer, M. (2015). Part logistics in the automotive industry: Decision problems, literature review and research agenda. European Journal of Operational Research, 242
Christiansen, M., Fagerholt, K., Nygreen, B., & Ronen, D. (2013). Ship routing and scheduling in the new millennium. European Journal of Operational Research, 228, 467–483.
De Paepe, W. E., Lenstra, J. K., Sgall, J., Sitters, R. A., & Stougie, L. (2004). Computer-aided complexity classification of dial-a-ride problems. INFORMS Journal on Computing, 16(2), 120–132.
Emde, S., & Boysen, N. (2012). Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines. European Journal of Operational Research, 217, 287–299.
Emde, S., Fliedner, M., & Boysen, N. (2012). Optimally loading tow trains for just-in-time supply of mixed-model assembly lines. IIE Transactions, 44(2), 121–135.
Ferrucci, F., Bock, S., & Gendreau, M. (2013). A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods. European Journal of Operational Research, 225(3), 130–141.
García, A., Jodrá, P., & Tejel, J. (2002). A note on the traveling repairman problem. Networks, 40(1), 27–31.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2000). Diversion issues in real-time vehicle dispatching. Transportation Science, 34, 426–438.
Kilic, H. S., & Durmusoglu, M. B. (2015). Advances in assembly line parts feeding policies: A literature review. Assembly Automation, 35(1), 57–68.
Lenstra, J. K., Rinnoy Kan, A. H. G., & Brucker, B. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.
Manne, A. S. (1960). On job-shop scheduling problem. Operations Research, 8(2), 219–223.
Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37(5), 798–804.
Pinedo, M. (2008). Scheduling: Theory, Algorithms, and Systems (3rd ed.). Berlin: Springer.
Psaraftis, H. N., Solomon, M. M., Magnanti, T. L., & Kim, T.-U. (1990). Routing and scheduling on a shoreline with release times. Management Science, 36(2), 212–223.
Roshanaei, V., Azab, A., & ElMaraghy, H. (2013). Mathematical modelling and a meta-heuristic for flexible job shop scheduling. International Journal of Production Research, 51(20), 6247–6274.
Sitters, R. A. (2004). Complexity and approximation in routing and scheduling. PhD thesis, Technische Universiteit Eindhoven.
Tsitsiklis, J. N. (1992). Special cases of traveling salesman and repairman problems with time windows. Networks, 22(3), 263–282.
Yu, W., & Liu, Z. (2014). Vehicle routing problems with regular objective functions on a path. Naval Research Logistics, 61(1), 34–43.
Zeng, J., Mitchell, J., & Gao, J. (2014). The data gathering problem for sensors on a line or a tree. The 2014 Fall Workshop on Computational Geometry.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bock, S. Finding optimal tour schedules on transportation paths under extended time window constraints. J Sched 19, 527–546 (2016). https://doi.org/10.1007/s10951-016-0481-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-016-0481-1