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

Authors:
Ada Che;Hongjian Hu;Michelle Chabrol;Michel Gourgand
Affiliations:
School of Management, Northwestern Polytechnical University, Xi'an 710072, PR China;School of Management, Northwestern Polytechnical University, Xi'an 710072, PR China;LIMOS, Université Blaise Pascal, CNRS UMR 6158, Campus des Cézeaux, 63173 Aubière, France;LIMOS, Université Blaise Pascal, CNRS UMR 6158, Campus des Cézeaux, 63173 Aubière, France
Venue:
Computers and Operations Research
Year:
2011

Citing 15
Cited 1

A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

Computers and Operations Research
Robotic cell scheduling with operational flexibility

Discrete Applied Mathematics
An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem

Operations Research
Sequencing and Scheduling in Robotic Cells: Recent Developments

Journal of Scheduling
A faster polynomial algorithm for 2-cyclic robotic scheduling

Journal of Scheduling
Scheduling in a three-machine robotic flexible manufacturing cell

Computers and Operations Research
Identical part production in cyclic robotic cells: Concepts, overview and open questions

Discrete Applied Mathematics
Scheduling of coupled tasks and one-machine no-wait robotic cells

Computers and Operations Research
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

Discrete Applied Mathematics
Note: A quadratic algorithm for the 2-cyclic robotic scheduling problem

Theoretical Computer Science
Note: A quadratic algorithm for the 2-cyclic robotic scheduling problem

Theoretical Computer Science
An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

Operations Research Letters
Minimizing the fleet size with dependent time-window and single-track constraints

Operations Research Letters
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Operations Research Letters
Part sequencing in three-machine no-wait robotic cells

Operations Research Letters

Two-machine robotic cell scheduling problem with sequence-dependent setup times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the multi-robot 2-cyclic scheduling problem in a no-wait robotic cell where exactly two parts enter and leave the cell during each cycle and multiple robots on a single track are responsible for transporting parts between machines. We develop a polynomial algorithm to find the minimum number of robots for all feasible cycle times. Consequently, the optimal cycle time for any given number of robots can be obtained with the algorithm. The proposed algorithm can be implemented in O(N^7) time, where N is the number of machines in the considered robotic cell.