Robotic cell scheduling with operational flexibility

Authors:
M. Selim Akturk;Hakan Gultekin;Oya Ekin Karasan
Affiliations:
Department of Industrial Engineering, Bilkent University, Bilkent, Ankara 06533, Turkey;Department of Industrial Engineering, Bilkent University, Bilkent, Ankara 06533, Turkey;Department of Industrial Engineering, Bilkent University, Bilkent, Ankara 06533, Turkey
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 2
Cited 10

Makespan minimization for flow-shop problems with transportation times and a single robot

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

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
Pure cycles in flexible robotic cells

Computers and Operations Research
Bicriteria robotic cell scheduling

Journal of Scheduling
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

Discrete Applied Mathematics
Bicriteria robotic operation allocation in a flexible manufacturing cell

Computers and Operations Research
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
Cyclic scheduling of a robotic flexible cell with load lock and swap

Journal of Intelligent Manufacturing
Two-machine robotic cell scheduling problem with sequence-dependent setup times

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we study the problem of two-machine, identical parts robotic cell scheduling with operational flexibility. We assume that every part to be processed has a number of operations to be completed in these two machines and both machines are capable of performing all of the operations. The decision to be made includes finding the optimal robot move cycle and the corresponding optimal allocation of operations to these two machines that jointly minimize the cycle time. We prove that with this definition of the problem 1-unit robot move cycles are no longer necessarily optimal and that according to the given parameters either one of the 1-unit robot move cycles or a 2-unit robot move cycle is optimal. The regions of optimality are presented.