Minimizing the number of late jobs in a stochastic setting using a chance constraint
From MaRDI portal
Publication:835575
DOI10.1007/S10951-007-0034-8zbMath1168.90484OpenAlexW2019293698MaRDI QIDQ835575
Marjan van den Akker, Hoogeveen, J. A.
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-0034-8
schedulingDynamic programmingsingle machinesequencingNP-hardnessstochastic processing timesnumber of late jobsChance constraintMinimum success probability
Related Items (11)
Safe scheduling: Setting due dates in single-machine problems ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ Multi-criteria scheduling: an agent-based approach for expert knowledge integration ⋮ A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs ⋮ Single machine scheduling with release dates: a distributionally robust approach ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
Cites Work
- Unnamed Item
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Minimizing the number of late jobs in a stochastic setting using a chance constraint
