Stochastically minimizing total penalty costs in the two-machine flow shop with random processing times. (English) Zbl 0714.90053
Summary: A set of n jobs is to be processed on two-machines in series. The job processing times are independent random variables. We first develop a sufficient condition on the processing time distributions to reduce stochastically a total penalty cost function. We then establish, for exponential job processing times, a set of sufficient and transitive conditions for stochastically minimizing a total penalty cost function. Two examples are given to illustrate the results.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
Keywords:
random processing times; stochastic scheduling; flow shop; two-machines; penalty cost function; exponential job processing timesReferences:
| [1] | Bagga P.C., Opsearch 7 pp 184– (1970) |
| [2] | Cunningham A.A., Naval Research Logistics Quarterly 20 pp 69– (1973) · Zbl 0254.90021 · doi:10.1002/nav.3800200107 |
| [3] | Forst F.G., An analysis of the two-machine static, stochastic flowshop with linear completion time costs (1981) |
| [4] | Forst F.G., Operations Research Letters 2 pp 58– (1983) · Zbl 0506.90038 · doi:10.1016/0167-6377(83)90037-8 |
| [5] | Ku P.S., Operations Research 34 pp 130– (1986) · Zbl 0595.90044 · doi:10.1287/opre.34.1.130 |
| [6] | Lenstra J.K., Annals of Discrete Mathematics 1 pp 343– (1977) · doi:10.1016/S0167-5060(08)70743-X |
| [7] | Pinedo M., Operations Research 30 pp 148– (1982) · Zbl 0481.90047 · doi:10.1287/opre.30.1.148 |
| [8] | Pinedo M., Applied Stochastic Models and Data Analysis 2 pp 61– (1986) · Zbl 0633.90027 · doi:10.1002/asm.3150020106 |
| [9] | Rothkopf M.H., Management Science 12 pp 707– (1966) · Zbl 0199.23302 · doi:10.1287/mnsc.12.9.707 |
| [10] | Solomon M.M., American Journal of Mathematical and Management Sciences 6 pp 399– (1986) · Zbl 0634.90046 · doi:10.1080/01966324.1986.10737201 |
| [11] | Weiss G., Deterministic and Stochastic Scheduling pp 163– (1982) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
