On stochastic scheduling problems with due dates
From MaRDI portal
Publication:3669163
DOI10.1080/00207728308926528zbMath0519.90044MaRDI QIDQ3669163
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
single machine; stochastic scheduling; due dates; suboptimal strategies; collection of stochastic jobs; highest completion rate strategy
90B35: Deterministic scheduling theory in operations research
Related Items
Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop, On the optimal allocation of service to impatient tasks, Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards, Minimizing the expected weighted number of tardy jobs in stochastic flow shops, Bounds on optimal values in stochastic scheduling, A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering, 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
Cites Work
