zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On Johnson’s two-machine flow shop with random processing times. (English) Zbl 0595.90044
Summary: A set of n jobs is to be processed by two machines in series that are separated by an infinite waiting room; each job requires a (known) fixed amount of processing from each machine. In a classic paper, Johnson gave a simple rule for ordering of the set of jobs to minimize the time until the system becomes empty, i.e., the makespan. This paper studies a stochastic generalization of this problem in which job processing times are independent random variables. Our main result is a sufficient condition on the processing time distributions that implies that the makespan becomes stochastically smaller when two adjacent jobs in a given job sequence are interchanged. We also give an extension of the main result to job shops.

90B35Scheduling theory, deterministic
Full Text: DOI