On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case

DOI10.1080/03155986.1999.11732366OpenAlexW2398706654WikidataQ122949572 ScholiaQ122949572MaRDI QIDQ5888081

Gerd Finke, Nadia Brauner

Publication date: 21 April 2023

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

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

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

Scheduling in a three-machine robotic flexible manufacturing cell ⋮ Identical part production in cyclic robotic cells: Concepts, overview and open questions ⋮ On the existence of dominating 6-cyclic schedules in four-machine robotic cells ⋮ Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells ⋮ Scheduling no-wait robotic cells with two and three machines ⋮ Cycles and permutations in robotic cells ⋮ Scheduling dual gripper robotic cell: one-unit cycles