A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line

DOI10.1016/j.orl.2003.10.012zbMath1140.90393OpenAlexW2055603202WikidataQ57185943 ScholiaQ57185943MaRDI QIDQ1779707

Ada Che, Chengbin Chu

Publication date: 1 June 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.10.012

zbMATH Keywords

Polynomial algorithmNo-waitCyclic schedulingHoist scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Cyclic hoist scheduling in large real-life electroplating lines ⋮ Cycle time analysis of dual-arm cluster tools for wafer fabrication processes with multiple wafer revisiting times ⋮ Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ 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

Cites Work

• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
• A polynomial algorithm for 2-degree cyclic robot scheduling
• Part sequencing in three-machine no-wait robotic cells