Dynamic scheduling of stochastic jobs on a single machine
From MaRDI portal
Publication:1600933
DOI10.1016/S0377-2217(01)00174-6zbMath1007.90029MaRDI QIDQ1600933
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90B36: Stochastic scheduling theory in operations research
Related Items
MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE, Modeling the dynamics of a multi-product manufacturing system: a real case application, Setting optimal due dates in a basic safe-scheduling model, A survey of single machine scheduling to minimize weighted number of tardy jobs, Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem, Distributionally robust single machine scheduling with risk aversion, Trading off due-date tightness and job tardiness in a basic scheduling model, Minimizing earliness and tardiness costs in stochastic scheduling, Solving a stochastic single machine problem with initial idle time and quadratic objective
Cites Work
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Bounds on optimal values in stochastic scheduling
- Rearrangement, Majorization and Stochastic Scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- Stochastic Scheduling with Release Dates and Due Dates
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
