Bicriteria robotic cell scheduling

Authors:
Hakan Gultekin;M. Selim Akturk;Oya Ekin Karasan
Affiliations:
Department of Industrial Engineering, Bilkent University, Bilkent, Turkey 06800;Department of Industrial Engineering, Bilkent University, Bilkent, Turkey 06800;Department of Industrial Engineering, Bilkent University, Bilkent, Turkey 06800
Venue:
Journal of Scheduling
Year:
2008

Citing 7
Cited 2

A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

Discrete Applied Mathematics
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

SIAM Journal on Optimization
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research
Robotic cell scheduling with operational flexibility

Discrete Applied Mathematics
Sequencing and Scheduling in Robotic Cells: Recent Developments

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

Journal of Scheduling
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms

Bicriteria robotic operation allocation in a flexible manufacturing cell

Computers and Operations Research
An analysis of cyclic scheduling problems in robot centered cells

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the scheduling problems arising in two- and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where transportation of the parts between the machines is performed by a robot. The cycle time of the cell is affected by the robot move sequence as well as the processing times of the parts on the machines. For highly flexible CNC machines, the processing times can be changed by altering the machining conditions at the expense of increasing the manufacturing cost. As a result, we try to find the robot move sequence as well as the processing times of the parts on each machine that not only minimize the cycle time but, for the first time in robotic cell scheduling literature, also minimize the manufacturing cost. For each 1-unit cycle in two- and three-machine cells, we determine the efficient set of processing time vectors such that no other processing time vector gives both a smaller cycle time and a smaller cost value. We also compare these cycles with each other to determine the sufficient conditions under which each of the cycles dominates the rest. Finally, we show how different assumptions on cost structures affect the results.