Showing 1 - 10 of 33
In many applications, robotic cells are used in repetitive production of identical parts. A robotic cell contains two or more robot-served machines. The robot can have single or dual gripper. The cycle time is the time to produce a part in the cell. We consider single part-type problems. Since...
Persistent link: https://www.econbiz.de/10014046907
In this paper, we deal with the problem of sequencing parts and robot moves in a robotic cell where the robot is used to feed machines in the cell. The robotic cell, which produces a set of parts of the same or different types, is a flow-line manufacturing system. Our objective is to maximize...
Persistent link: https://www.econbiz.de/10014047541
A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. We examine the recent developments in this literature. A robotic flowshop cell consists of a number of processing stages served by one or more robots. Each stage has...
Persistent link: https://www.econbiz.de/10014218350
A robotic cell - manufacturing system widely used in industry - contains two or more robot-served machines, repetitively producing a number of part types. In this paper, we consider scheduling of operations in a bufferless dual-gripper robotic cell processing multiple part types. The processing...
Persistent link: https://www.econbiz.de/10014218586
We discuss the performance of scheduling algorithms for a certain kind of manufacturing environment, called the "Flexible Flowshop", which consists of a certain number of machine centers. Each center has one or more identical parallel machines. Each part is processed by at most one machine in...
Persistent link: https://www.econbiz.de/10014219051
The issue of allocating capacity to accommodate emergent surgery cases while scheduling elective patients has major policy implications for Level-1 trauma centers including most large academic medical centers. This is because operating rooms (ORs) are the greatest source of revenues for...
Persistent link: https://www.econbiz.de/10012956747
We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...
Persistent link: https://www.econbiz.de/10013152472
Persistent link: https://www.econbiz.de/10012821046
Persistent link: https://www.econbiz.de/10003982025
Persistent link: https://www.econbiz.de/10009315465