Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop

DOI10.1080/01966324.1992.10737339zbMath0772.90051OpenAlexW2325047752MaRDI QIDQ4695014

Frank G. Forst

Publication date: 11 October 1993

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.1992.10737339

zbMATH Keywords

optimality conditionsstochastic schedulingtardinessdue datestwo-machine flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Scheduling stochastic jobs on a single machine subject to breakdowns
• On stochastic scheduling problems with due dates
• Stochastic Scheduling with Release Dates and Due Dates
• Minimizing the Expected Makespan in Stochastic Flow Shops