On stochastic scheduling problems with due dates

DOI10.1080/00207728308926528MaRDI QIDQ3669163zbMATH OpenOpenAlexFDO

Authors Kevin D. Glazebrook

Publication date 1983

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

collection of stochastic jobsdue dateshighest completion rate strategysingle machinestochastic schedulingsuboptimal strategies

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

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

Cited in

(8)

• 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
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3669163)