Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach

DOI10.1080/00207540410001666288zbMath1059.90064OpenAlexW2110399144WikidataQ57185964 ScholiaQ57185964MaRDI QIDQ4671265

Ada Che, Chengbin Chu

Publication date: 26 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540410001666288

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows ⋮ Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic ⋮ Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times ⋮ Robust optimization for the cyclic hoist scheduling problem ⋮ Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows ⋮ Scheduling multiple factory cranes on a common track ⋮ Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm ⋮ Optimal cyclic single crane scheduling for two parallel train oilcan repairing lines ⋮ A solution for cyclic scheduling of multi-hoists without overlapping

Cites Work

• Minimizing the fleet size with dependent time-window and single-track constraints
• Minimizing the number of robots to meet a given cyclic schedule
• Current trends in deterministic scheduling
• A polynomial algorithm for 2-degree cyclic robot scheduling
• The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints

This page was built for publication: Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach