Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
From MaRDI portal
Publication:4380546
DOI10.1080/03155986.1997.11732338zbMath0894.90084MaRDI 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
NP-hard problem; constraint logic programming; overlapping zone; cyclic hoist scheduling problem; electroplating facilities; hoist assignment; multi-hoists problem
90B35: Deterministic scheduling theory in operations research
Related Items
Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows, Robust optimization for the cyclic hoist scheduling problem, Scheduling multiple factory cranes on a common track, A faster polynomial algorithm for 2-cyclic robotic scheduling, Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm, Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots, On-line scheduling in a surface treatment system, A solution for cyclic scheduling of multi-hoists without overlapping, Cyclic hoist scheduling in large real-life electroplating lines