Stochastically minimizing the makespan in two-machine flow shops without blocking
type: Item
instance of: scholarly article
title: Stochastically minimizing the makespan in two-machine flow shops without blocking
zbMATH Open document ID: 0938.90029
DOI: 10.1016/S0377-2217(97)00424-4
author: Jerzy Kamburowski
published in: European Journal of Operational Research
publication date: 2000-06-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1358471
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: flow shop
zbMATH Keywords: stochastic ordering
zbMATH Keywords: makespan
MaRDI profile type: Publication
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times
cites work: Q3525910
cites work: Q4301147
cites work: The Reversibility Property of Production Lines
cites work: A generalized bivariate exponential distribution
cites work: Rearrangement, Majorization and Stochastic Scheduling
cites work: Minimizing the Expected Makespan in Stochastic Flow Shops
cites work: The stochastic flowshop makespan. Part II. Some general results for the unbuffered case
description: scientific article; zbMATH DE number 1358471