Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
type: Item
instance of: scholarly article
title: Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
zbMATH Open document ID: 0927.90044
DOI: 10.1016/0377-2217(93)E0318-R
author: Ali Allahverdi
author: John Mittenthal
published in: European Journal of Operational Research
publication date: 1999-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1191275
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: two-machine flowshop scheduling
zbMATH Keywords: makespan
zbMATH Keywords: random breakdowns
MaRDI profile type: Publication
cites work: Q4306273
cites work: Single-machine scheduling subject to stochastic breakdowns
cites work: Q3993992
cites work: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
cites work: Q3970631
cites work: Stochastically minimizing the makespan in flow shops
cites work: Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shop
cites work: Minimizing total expected costs in the two-machine, stochastic flow shop
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times
cites work: Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
cites work: Minimizing the Expected Makespan in Stochastic Flow Shops
cites work: nx2 flowshop sequencing problem with random processing times
cites work: Q3218851
full work available at URL: 0377-2217(93)e0318-r
OpenAlex ID: W2070699284
description: scientific article; zbMATH DE number 1191275