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

DOI10.1016/j.cor.2020.105164OpenAlexW3106970203MaRDI QIDQ2027031

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

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

integer programmingjob shop schedulinglock schedulinginland waterway

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A survey of job shop scheduling problem: the types and models

Cites Work

• 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
• Exact and heuristic methods for placing ships in locks
• Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock
• 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: An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective