Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective

DOI10.1016/j.ejor.2020.05.035zbMath1487.90298OpenAlexW3031404442MaRDI QIDQ2028839

Samson S. Yu, Dezhi Zhang, Binqiao Zhang, Bin Ji

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.05.035

zbMATH Keywords

combinatorial optimizationmixed integer linear programmingmulti-commodity networkinland waterwayserial-lock scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Mathematical programming models for lock scheduling with an emission objective
• The lockmaster's problem
• A combinatorial Benders' decomposition for the lock scheduling problem
• Exact and heuristic methods for optimizing lock-quay system in inland waterway
• Two-dimensional packing problems: a survey
• Exact and heuristic methods for placing ships in locks
• Storage yard operations in container terminals: literature overview, trends, and research directions
• Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock
• The two-dimensional bin packing problem with variable bin sizes and costs
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Simulation of alternative approaches to relieving congestion at locks in a river transportion system
• An Optimal Scheduling System for the Welland Canal
• Ship Traffic Optimization for the Kiel Canal

This page was built for publication: Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective