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

DOI10.1007/s10951-007-0022-zzbMath1168.90490OpenAlexW2108353599MaRDI QIDQ835573

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

sequencingpolynomial algorithmstochastic scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (6)

Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Safe scheduling: Setting due dates in single-machine problems ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Minimizing the number of late jobs when the start time of the machine is variable ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process

Cites Work

• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
• Unnamed Item

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