An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective

DOI10.1016/J.COR.2020.105164MaRDI QIDQ2027031zbMATH OpenOpenAlexFDO

Authors Bin Ji, Dezhi Zhang, S. S. Yu, Xiaoping Fang

Publication date 21 May 2021

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.105164

zbMATH Keywords

inland waterwayinteger programmingjob shop schedulinglock scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective
• Solving the flexible job shop scheduling problem with sequence-dependent setup times
• A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
• An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Flexible job-shop scheduling problem under resource constraints
• Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources

Cites work

• A combinatorial Benders' decomposition for the lock scheduling problem
• An Optimal Scheduling System for the Welland Canal
• 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
• The lockmaster's problem

Cited in

(4)

• Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective
• A survey of job shop scheduling problem: the types and models
• Mathematical programming models for lock scheduling with an emission objective
• A combinatorial Benders' decomposition for the lock scheduling problem

This page was built for publication: An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective

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