Premium
A generalized Johnson's rule for stochastic assembly systems
Author(s) -
Righter Rhonda
Publication year - 1997
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199703)44:2<211::aid-nav5>3.0.co;2-c
Subject(s) - computer science , set (abstract data type) , regular polygon , schedule , mathematical optimization , mathematical economics , mathematics , geometry , programming language , operating system
Johnson's rule gives the optimal order to schedule a set of jobs through a two‐machine flow shop with deterministic processing times. We extend Johnson's rule to fork‐join 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. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 211–220, 1997