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
Non-bottleneck machines in three-machine flow shops
β Scribed by Jerzy Kamburowski
- Publisher
- Springer US
- Year
- 2000
- Tongue
- English
- Weight
- 152 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1094-6136
No coin nor oath required. For personal study only.
β¦ Synopsis
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 worst-case performance ratio of these algorithms is 2, and the bound of 2 is tight. We also present a new su$cient condition for identifying the intermediate non-bottleneck machine which is weaker than all conditions proposed so far.
π SIMILAR VOLUMES
We consider the scheduling problems F2 "" C and F2"no-wait"C , i.e. makespan minimization in a two-machine flow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n log n) running time are known, where n denotes the number of jobs. [1,2]. We pro
## Abstract One hundred machine-preserved cadaver kidneys were transplanted irrespective of their flow rates on the preservation machine. Twenty-five per cent had flows of below 100 ml/min and 11 per cent had flows of below 80 ml/min. There was no correlation between the flow rate and function at 1