Article (Scientific journals)
Cyclic scheduling of identical parts in a robotic cell
Crama, Yves; Van de Klundert, Joris
1997In Operations Research, 45, p. 952-965
Peer Reviewed verified by ORBi
 

Files


Full Text
cycle_or.pdf
Author preprint (254.69 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
robotic cell; scheduling; flowshop
Abstract :
[en] We consider a robotic flowshop in which one type of product is to be repeatedly produced and where transportation of the parts between the machines is performed by the robot. The identical parts cyclic scheduling problem is then to find a shortest cyclic schedule for the robot, i.e., a sequence of robot moves that can be repeated infinitely many times and has minimum cycle time. This problem has been solved by Sethi et al. (1992) when m <= 3. In this paper, we considerably generalize their results by proving that the identical parts cyclic scheduling problem can be solved in time polynomial in m, where m denotes the number of machines in the shop. In particular, we present a dynamic programming approach that allows to solve the problem in O(m^3) time. Our analysis heavily relies on the concept of pyramidal permutation, a concept previously investigated in connection with the traveling salesman problem.
Disciplines :
Production, distribution & supply chain management
Quantitative methods in economics & management
Author, co-author :
Crama, Yves  ;  Université de Liège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production
Van de Klundert, Joris
Language :
English
Title :
Cyclic scheduling of identical parts in a robotic cell
Publication date :
1997
Journal title :
Operations Research
ISSN :
0030-364X
eISSN :
1526-5463
Publisher :
Operations Research Society of America, Baltimore, United States - Maryland
Volume :
45
Pages :
952-965
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 12 October 2016

Statistics


Number of views
55 (3 by ULiège)
Number of downloads
311 (0 by ULiège)

Scopus citations®
 
149
Scopus citations®
without self-citations
147
OpenCitations
 
131

Bibliography


Similar publications



Contact ORBi