On stochastic scheduling problems with due dates

DOI10.1080/00207728308926528zbMath0519.90044OpenAlexW2054754247MaRDI QIDQ3669163

Kevin D. Glazebrook

Publication date: 1983

Published in: International Journal of Systems Science (Search for Journal in Brave)

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

zbMATH Keywords

single machinestochastic schedulingdue datessuboptimal strategiescollection of stochastic jobshighest completion rate strategy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Minimizing the expected weighted number of tardy jobs in stochastic flow shops ⋮ On the optimal allocation of service to impatient tasks ⋮ Bounds on optimal values in stochastic scheduling ⋮ SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS ⋮ An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system ⋮ Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop ⋮ Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards ⋮ A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering

Cites Work

• Stochastic scheduling with order constraints
• On Bayesian models in stochastic scheduling

This page was built for publication: On stochastic scheduling problems with due dates