Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times

DOI10.1080/01966324.1988.10737234zbMath0714.90053OpenAlexW1972359790WikidataQ58249513 ScholiaQ58249513MaRDI QIDQ3200873

Frank G. Forst

Publication date: 1988

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1988.10737234

zbMATH Keywords

flow shopstochastic schedulingrandom processing timesexponential job processing timespenalty cost functiontwo-machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Minimizing total expected costs in the two-machine, stochastic flow shop
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Inequalities for stochastic flow shops and job shops
• The Minimum Spanning Tree Problem with Time Window Constraints
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Scheduling with Random Service Times
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop