Part sequencing in three-machine no-wait robotic cells

Authors:
A. Agnetis;D. Pacciarelli
Affiliations:
Dipartimento di Informatica e Sistemistica, Universití di Roma "La Sapienza", via Buonarroti 12, 00185 Roma, Italy;Dipartimento di Informatica e Automazione, Universití di Roma Tre, via della Vasca Navale 79, 00146 Roma, Italy
Venue:
Operations Research Letters
Year:
2000

Citing 2
Cited 5

The Three-Machine No-Wait Flow Shop is NP-Complete

Journal of the ACM (JACM)
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Operations Research Letters

Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells

Journal of Scheduling
Sequencing and Scheduling in Robotic Cells: Recent Developments

Journal of Scheduling
Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey

Computers and Industrial Engineering
A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell

Computers and Operations Research
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A no-wait robotic cell is an automated flow shop in which a robot is used to move the parts from a machine to the next. Parts are not allowed to wait. We analyze the complexity of the part sequencing problem in a robotic cell with three machines, for different periodical patterns of robot moves, when the objective is productivity maximization.