No-Wait Scheduling for Locks

References

• Aspvall B, Plass MF, Tarjan RE (1979) A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Processing Lett. 8(3):121–123.Crossref, Google Scholar
• Böhmová K, Disser Y, Mihalák M, Widmayer P (2013) Interval selection with machine-dependent intervals. Dehne F, Solis-Oba R, Sack JR, eds. Proc. Algorithms Data Structures 13th Internat. Sympos. (Springer, Berlin), 170–181.Crossref, Google Scholar
• Cornell Law School (Legal Information Institute) (2006) 33 cfr 207.718-navigation locks and approach channels, Columbia and Snake Rivers, Oreg. and Wash. Accessed July 28, 2017, https://www.law.cornell.edu/cfr/text/33/207.718.Google Scholar
• Disser Y, Klimm M, Lübbecke E (2015) Scheduling bidirectional traffic on a path. Halldórsson MM, Iwama K, Kobayashi N, Speckmann B, eds. Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 9134 (Springer, Berlin), 406–418.Crossref, Google Scholar
• Even S, Itai A, Shamir A (1976) On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4):691–703.Crossref, Google Scholar
• Felsner S, Müller R, Wernisch L (1997) Trapezoid graphs and generalizations, geometry and algorithms. Discrete Appl. Math. 74(1):13–32.Crossref, Google Scholar
• Ford LR, Fulkerson DR (1962) Flows in Networks (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Gupta U, Lee DT, Leung JYT (1979) An optimal solution for the channel-assignment problem. IEEE Trans. Comput. C-28(11):807–810.Crossref, Google Scholar
• Hermans J (2014) Optimization of inland shipping - a polynomial time algorithm for the single ship single lock optimization problem. J. Scheduling 17(4):305–319.Crossref, Google Scholar
• Kolen AWJ, Lenstra JK, Papadimitriou CH, Spieksma FCR (2007) Interval scheduling: A survey. Naval Res. Logist. 54(5):530–543.Crossref, Google Scholar
• Krumke SO, Thielen C, Westphal S (2011) Interval scheduling on related machines. Comput. Oper. Res. 38(12):1836–1844.Crossref, Google Scholar
• Passchyn W (2016) Scheduling locks on inland waterways. PhD thesis, KU Leuven, Leuven, Belgium.Google Scholar
• Passchyn W, Briskorn D, Spieksma FCR (2016a) Mathematical programming models for lock scheduling with an emission objective. Eur. J. Oper. Res. 248(3):802–814.Crossref, Google Scholar
• Passchyn W, Briskorn D, Spieksma FCR (2016b) No-wait scheduling for locks. Technical Report KBI_1605, KU Leuven, Research Group Operations Research and Business Statistics, Leuven, Belgium.Crossref, Google Scholar
• Passchyn W, Coene S, Briskorn D, Hurink JL, Spieksma FCR, Vanden Berghe G (2016c) The lockmaster’s problem. Eur. J. Oper. Res. 251(2):432–441.Crossref, Google Scholar
• Prandtstetter M, Ritzinger U, Schmidt P, Ruthmair M (2015) A variable neighborhood search approach for the interdependent lock scheduling problem. Ochoa G, Chicano F, eds. Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, vol. 9026 (Springer International Publishing, Berlin), 36–47.Crossref, Google Scholar
• Savenije R (1997) Admittance policy deep draught vessels and safety. Sung JS, Das BM, Matsui T, Thiel H, eds. Proc. Internat. Offshore Polar Engrg. Conf. (International Society of Offshore and Polar Engineers, Cupertino, CA), 289–296.Google Scholar
• Smith LD, Nauss RM, Mattfeld DC, Li J, Ehmke JF, Reindl M (2011) Scheduling operations at system choke points with sequence-dependent delays and processing times. Transportation Res. E 47(5):669–680.Crossref, Google Scholar
• Sung SC, Vlach M (2005) Maximizing weighted number of just-in-time jobs on unrelated parallel machines. J. Scheduling 8(5):453–460.Crossref, Google Scholar
• Ting C, Schonfeld P (2001) Control alternatives at a waterway lock. J. Waterway Port Coast Ocean Engrg. 127(2):89–96.Crossref, Google Scholar
• Vantorre M, Candries M, Verwilligen J (2014) Optimisation of tidal windows for deep-drafted vessels by means of a probabilistic approach policy for access channels with depth limitations. Proc. 33rd PIANC World Congress (Curran Associates, Red Hook, NY), 1–18.Google Scholar
• Verstichel J (2013) The lock scheduling problem. PhD thesis, KU Leuven, Leuven, Belgium.Google Scholar
• Verstichel J, De Causmaecker P, Vanden Berghe G (2011) Scheduling algorithms for the lock scheduling problem. Procedia Soc. Behav. Sci. 20:806–815.Crossref, Google Scholar
• Verstichel J, De Causmaecker P, Spieksma FCR, Vanden Berghe G (2014) The generalized lock scheduling problem: An exact approach. Transportation Res. E 65:16–34.Crossref, Google Scholar
• Waterwegen en Zeekanaal NV, nv De Scheepvaart (2014) Masterplan voor binnenvaart op de Vlaamse waterwegen—Horizon 2020. [Master plan for inland shipping on the Flemish waterways—Horizon 2020.] Report, nv De Scheepvaart, Willebroek, Belgium.Google Scholar