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

DOI10.1007/S10898-015-0285-4zbMATH Open1337.90023OpenAlexW1999888223MaRDI QIDQ897052FDOQ897052

Authors: Xu Cheng, Lixin Tang, Panos M. Pardalos 

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

Recommendations

• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Crane scheduling with time windows in circuit board production lines
• Scheduling of a single crane in batch annealing process
• The crane scheduling problem: models and solution approaches
• Branch-and-cut-and-price algorithms for the preemptive RCPSP

zbMATH Keywords

branch-and-cutvalid inequalitiesfactory crane scheduling probleminteger linear programming model

Mathematics Subject Classification ID

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

Cites Work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Handbook of applied optimization
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• The precedence-constrained asymmetric traveling salesman polytope
• Crane scheduling with spatial constraints
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• Crane scheduling in container yards with inter-crane interference
• Title not available (Why is that?)

Cited In (2)

• A HEURISTIC SCHEDULING ALGORITHM FOR STEEL MAKING PROCESS WITH CRANE HANDLING(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management)
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules

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

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