Dear scheduling researcher, We are delighted to announce the talk given by Defeng Sun (DAO lab, NEU China). The title is " Combinatorial Benders approach to solve the Quay Crane Scheduling Problem". The seminar will take place on Zoom on Wednesday, February 12 at 14:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/94791685557?pwd=p6XThOlSYXm8cT9n4db8dcjNSbiBiw.1 Meeting ID: 947 9168 5557 Passcode: 218539 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. We propose an exact decomposition approach to solve the Quay Crane Scheduling Problem (QCSP) in container terminals. The problem is decomposed into two simpler problems: a sequencing master problem and a scheduling sub-problem. The master problem explores possible operation sequencing solutions for the tasks, while the sub-problem determines the completion times for each task to avoid collisions among quay cranes. A series of combinatorial cuts based on minimum infeasible systems and minimum sub-optimal systems are generated to accelerate the algorithm convergence. Furthermore, we provide a cut selection strategy to generate tighter multiple cuts. Computational tests on benchmark instances verify the effectiveness of the proposed approach. The next talk in our series will be: Daniele Vigo (Unibo CIRI-ICT) | March 12 | One Million ... and Beyond! Solving Huge-Scale Vehicle Routing Problems in a Handful of Minutes For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/