Scheduling jobs with stochastic processing times and due dates to minimize total tardiness

DOI10.1080/15326349208807237MaRDI QIDQ4021158zbMATH OpenOpenAlexFDO

Authors Chueng Chiu Huang, Gideon Weiss

Publication date 17 January 1993

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

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

zbMATH Keywords

total tardinessparallel identical machinesdifferent stochastic order relationsexpected earliest due date sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Recommendations

• Scheduling stochastic jobs with due dates on parallel machines
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• scientific article; zbMATH DE number 1061797
• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• One machine scheduling to minimize expected mean tardiness. II

Cited in

(8)

• Trading off due-date tightness and job tardiness in a basic scheduling model
• Multi-objective stochastic scheduling of job ready times
• Stochastic sequencing with job families, set-up times, and due dates
• scientific article; zbMATH DE number 6677416 (Why is no real title available?)
• On the optimality of the earliest due date rule in stochastic scheduling and in queueing
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Fixed-time schedules for the processing of jobs when service completions are not observable
• Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines

This page was built for publication: Scheduling jobs with stochastic processing times and due dates to minimize total tardiness

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