A branch-and-cut algorithm for factory crane scheduling problem

DOI10.1007/s10898-015-0285-4zbMath1337.90023OpenAlexW1999888223MaRDI QIDQ897052

Xu Cheng, Panos M. Pardalos, Lixin Tang

Publication date: 16 December 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0285-4

zbMATH Keywords

valid inequalitiesbranch-and-cutfactory crane scheduling probleminteger linear programming model

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Crane scheduling in container yards with inter-crane interference
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• The precedence-constrained asymmetric traveling salesman polytope
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• Crane scheduling with spatial constraints
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal

This page was built for publication: A branch-and-cut algorithm for factory crane scheduling problem