Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions

DOI10.1080/03155986.1997.11732338zbMath0894.90084OpenAlexW2397212977MaRDI QIDQ4380546

Astrid Bachelu, Christophe Varnier, Pierre Baptiste

Publication date: 17 March 1998

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

NP-hard problemconstraint logic programmingoverlapping zonecyclic hoist scheduling problemelectroplating facilitieshoist assignmentmulti-hoists problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Robust optimization for the cyclic hoist scheduling problem ⋮ Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows ⋮ Cyclic hoist scheduling in large real-life electroplating lines ⋮ Scheduling multiple factory cranes on a common track ⋮ A faster polynomial algorithm for 2-cyclic robotic scheduling ⋮ On-line scheduling in a surface treatment system ⋮ Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm ⋮ A solution for cyclic scheduling of multi-hoists without overlapping ⋮ Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots

This page was built for publication: Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions