𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cyclic scheduling in 3-machine robotic flow shops

✍ Scribed by Yves Crama; Joris Van de Klundert

Publisher
Springer US
Year
1999
Tongue
English
Weight
152 KB
Volume
2
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

✦ Synopsis

We consider a robotic flow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a fixed sequence of activities. This sequence of activities is called a 1-unit cycle if each execution of the sequence results in the production of exactly one part. It has been conjectured that 1-unit cycles yield optimal production rates for 3-machine robotic flow shops. We establish the validity of this conjecture.

πŸ“œ SIMILAR VOLUMES

Cyclic scheduling in a robotic productio
Cyclic scheduling in a robotic production line
✍ Vladimir Kats; Eugene Levner πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 216 KB

The solution of cyclic scheduling problems is part of the classical repertoire on scheduling algorithms. We consider a problem of cyclic scheduling of identical parts in a production line where transportation of the parts between machines is performed by several robots. The problem is to ΓΏnd co-ordi

Non-bottleneck machines in three-machine
Non-bottleneck machines in three-machine flow shops
✍ Jerzy Kamburowski πŸ“‚ Article πŸ“… 2000 πŸ› Springer US 🌐 English βš– 152 KB

The paper deals with the classical problem of minimizing the makespan in a three-machine #ow shop. When any one of the three machines is a non-bottleneck machine, the problem is e$ciently solvable by one of three algorithms from the literature. We show that even if one chooses the best solution, the