On three-machine flow shops with random job processing times
type: Item
instance of: scholarly article
title: On three-machine flow shops with random job processing times
zbMATH Open document ID: 0952.90016
DOI: 10.1016/S0377-2217(99)00222-2
author: Jerzy Kamburowski
published in: European Journal of Operational Research
publication date: 2000-09-14T00:00:00Z
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 1507987
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: flow shop
zbMATH Keywords: makespan
zbMATH Keywords: stochastic order relation
MaRDI profile type: Publication
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Counterexamples to optimal permutation schedules for certain flow shop problems
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times
cites work: Stochastically minimizing the makespan in two-machine flow shops without blocking
cites work: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
cites work: nx2 flowshop sequencing problem with random processing times
cites work: Rearrangement, Majorization and Stochastic Scheduling
cites work: Minimizing the Expected Makespan in Stochastic Flow Shops
cites work: Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
cites work: Mathematical aspects of the 3 × n job-shop sequencing problem
cites work: Q3525910
cites work: Q4301147
cites work: Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem
description: scientific article; zbMATH DE number 1507987