Scheduling parallel batching machines in a sequence

  • Ward Passchyn
  • Frits C. R. Spieksma


Motivated by the application of scheduling a sequence of locks along a waterway, we consider a scheduling problem where multiple parallel batching machines are arranged in a sequence and process jobs that travel along this sequence. We investigate the computational complexity of this problem. More specifically, we show that minimizing the sum of completion times is strongly NP-hard, even for two identical machines and when all jobs travel in the same direction. A second NP-hardness result is obtained for a different special case where jobs all travel at an identical speed. Additionally, we introduce a class of so-called synchronized schedules and investigate special cases where the existence of an optimum solution which is synchronized can be guaranteed. Finally, we reinforce the claim that bidirectional travel contributes fundamentally to the computational complexity of this problem by describing a polynomial time procedure for a setting with identical machines and where all jobs travel in the same direction at equal speed.


Machine scheduling Complexity Parallel batching machine Machine sequence 



This research has been partially funded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office. This work was carried out when both authors were affiliated with KU Leuven. We thank the associate editor and the referees for their careful reading of the manuscript.

Supplementary material


  1. Adler, M., Sitaraman, R. K., Rosenberg, A. L., & Unger, W. (1998). Scheduling time-constrained communication in linear networks. In Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures, SPAA ’98 (pp. 269–278). New York, NY: ACM.Google Scholar
  2. Antoniadis, A., Barcelo, N., Cole, D., Fox, K., Moseley, B., Nugent, M., & Pruhs, K. (2014). Packet forwarding algorithms in a line network. In A. Pardo, & A. Viola (Eds.), LATIN 2014: Theoretical informatics: 11th Latin American symposium, Montevideo, Uruguay, March 31–April 4, 2014. Proceedings (pp. 610–621). Berlin: Springer.Google Scholar
  3. Brucker, P., Knust, S., Cheng, T. E., & Shakhlevich, N. V. (2004). Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research, 129(1), 81–106.CrossRefGoogle Scholar
  4. Disser, Y., Klimm, M., & Lübbecke, E. (2015). Scheduling bidirectional traffic on a path. Computing Research Repository abs/1504.07129.Google Scholar
  5. Frank, O. (1966). Two-way traffic on a single line of railway. Operations Research, 14(5), 801–811.CrossRefGoogle Scholar
  6. Gafarov, E. R., Dolgui, A., & Lazarev, A. A. (2015). Two-station single-track railway scheduling problem with trains of equal speed. Computers and Industrial Engineering, 85, 260–267.CrossRefGoogle Scholar
  7. Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976). Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3), 237–267.CrossRefGoogle Scholar
  8. Passchyn, W. (2016). Scheduling locks on inland waterways. Ph.D. thesis, KU Leuven.Google Scholar
  9. Passchyn, W., Briskorn, D., & Spieksma, F. C. R. (2016a). Mathematical programming models for lock scheduling with an emission objective. European Journal of Operational Research, 248(3), 802–814.Google Scholar
  10. Passchyn, W., Coene, S., Briskorn, D., Hurink, J. L., Spieksma, F. C. R., & Vanden Berghe, G. (2016b). The lockmaster’s problem. European Journal of Operational Research, 251(2), 432–441.CrossRefGoogle Scholar
  11. Petersen, E. R., & Taylor, A. J. (1988). An optimal scheduling system for the Welland Canal. Transportation Science, 22, 173–185.Google Scholar
  12. Prandtstetter, M., Ritzinger, U., Schmidt, P., & Ruthmair, M. (2015). A variable neighborhood search approach for the interdependent lock scheduling problem. In G. Ochoa, & F. Chicano (Eds.), Evolutionary Computation in Combinatorial Optimization , volume 9026 of Lecture Notes in Computer Science (pp. 36–47). Berlin: Springer.Google Scholar
  13. Righini, G. (2016). A network flow model of the northern Italy waterway system. EURO Journal on Transportation and Logistics, 5(2), 99–122.CrossRefGoogle Scholar
  14. Smith, L. D., Nauss, R. M., Mattfeld, D. C., Li, J., Ehmke, J. F., & Reindl, M. (2011). Scheduling operations at system choke points with sequence-dependent delays and processing times. Transportation Research Part E, 47, 669–680.CrossRefGoogle Scholar
  15. Smith, L. D., Sweeney, D. C., & Campbell, J. F. (2009). Simulation of alternative approaches to relieving congestion at locks in a river transportation system. Journal of the Operational Research Society, 60, 519–533.CrossRefGoogle Scholar
  16. Verstichel, J. (2013). The lock scheduling problem. Ph.D. thesis, KU Leuven.Google Scholar
  17. Verstichel, J., & Vanden Berghe, G. (2016). Scheduling serial locks: A green wave for waterbound logistics. In M. Lu & J. De Bock (Eds.), Sustainable logistics and supply chains: Innovations and integral approaches (pp. 91–109). Berlin: Springer.CrossRefGoogle Scholar
  18. Zhao, Z. J., Lau, H. C., & Ge, S. S. (2009). Integrated resource allocation and scheduling in a bidirectional flowshop with multimachine and COS constraints. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 39(2), 190–200.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Faculty of Economics and Business, ORSTATKU LeuvenLeuvenBelgium
  2. 2.OM PartnersWommelgemBelgium
  3. 3.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations