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

DOI10.1016/J.EJOR.2020.05.035MaRDI QIDQ2028839zbMATH OpenOpenAlexFDO

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

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 optimizationinland waterwaymixed integer linear programmingmulti-commodity networkserial-lock scheduling

Mathematics Subject Classification ID

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

Recommendations

• An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective
• Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem
• Mathematical programming models for lock scheduling with an emission objective
• The lockmaster's problem
• A combinatorial Benders' decomposition for the lock scheduling problem

Cites work

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

Cited in

(5)

• An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective
• Mathematical programming models for lock scheduling with an emission objective
• Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem
• A lock and port resource collaborative scheduling method based on mathematical programming model and heuristic
• Joint serial lock schedule design and sailing speed optimization on inland waterway for emission reduction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028839)