Multiple part-type scheduling in flexible robotic cells
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21604
International Journal of Production Economics
- Research Paper 
This paper considers the scheduling problem arising in two-machine manufacturing cells which repeatedly produce a set of multiple part-types, and where transportation of the parts between the machines is performed by a robot. The cycle time of the cell depends on 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 adjusted. To this end, this study tries to find the robot move sequence as well as the processing times of the parts on each machine that jointly minimize the cycle time. The problem of determining the best cycle in a 2-machine cell is first modeled as a traveling salesman problem. Then, an efficient 2-stage heuristic algorithm is constructed and compared with the most common heuristic approach of longest processing time (LPT). © 2011 Elsevier B.V. All Rights Reserved.
Showing items related by title, author, creator and subject.
Gultekin H.; Akturk, M.S.; Karasan O.E. (2006)In this study, a three-machine flexible robotic manufacturing cell in which the CNC machines are used is considered. These machines are highly flexible and are capable of performing several different operations. Each machine ...
Morgül Ö. (2011)We consider a flexible robot arm modeled as a rigid hub which rotates in an inertial space; a light flexible link is clamped to the rigid body at one end and is free at the other. We assume that the flexible link performs ...
Yildiz, S.; Akturk, M.S.; Karasan O.E. (2011)The current study deals with a bicriteria scheduling problem arising in an m-machine robotic cell consisting of CNC machines producing identical parts. Such machines by nature possess the process flexibility of altering ...