Minimizing the number of tardy jobs with stochastically-ordered processing times

DOI10.1007/S10951-007-0022-ZzbMATH Open1168.90490OpenAlexW2108353599MaRDI QIDQ835573FDOQ835573

Authors Dan Trietsch, Kenneth R. Baker 

Publication date 28 August 2009

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-007-0022-z

zbMATH Keywords

polynomial algorithmsequencingstochastic scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• Minimizing the number of late jobs in a stochastic setting using a chance constraint

Cites work

• scientific article; zbMATH DE number 1093829 (Why is no real title available?)
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

Cited in

(11)

• Minimizing the Range of Order Completion Times with Multiple Job Classes
• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
• Distributionally robust single machine scheduling with risk aversion
• Safe scheduling: Setting due dates in single-machine problems
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
• Minimizing the number of late jobs in a stochastic setting using a chance constraint
• Robust scheduling on a single machine to minimize total flow time
• Minimizing the number of late jobs when the start time of the machine is variable
• A note on the flow time and the number of tardy jobs in stochastic open shops
• Distributionally robust single machine scheduling with the total tardiness criterion

This page was built for publication: Minimizing the number of tardy jobs with stochastically-ordered processing times

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