A generalized Johnson's rule for stochastic assembly systems
β Scribed by Rhonda Righter
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 113 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
Johnson's rule gives the optimal order to schedule a set of jobs through a twomachine flow shop with deterministic processing times. We extend Johnson's rule to forkjoin systems with random processing times. Most of the system may be an arbitrary network. We give conditions under which Johnson's rule is optimal in the stochastic sense, in the increasing convex sense, and in expected value.
π SIMILAR VOLUMES
## Abstract A loadβsharing parallel system functions if at least one unit in the system is functioning and the surviving units share the load. In most of research on loadβsharing system, the performance of the system has been studied only for the case when the lifetimes of components in the system