Dynamic scheduling of stochastic jobs on a single machine
From MaRDI portal
(Redirected from Publication:1600933)
Recommendations
- Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
- On the scheduling of alternative stochastic jobs on a single machine
- Single-machine scheduling of stochastic jobs subject to deterioration or delay
- Scheduling stochastic jobs on a single machine subject to breakdowns
- Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
- Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
- Single-machine stochastic scheduling with dependent processing times
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 605729 (Why is no real title available?)
- scientific article; zbMATH DE number 1061797 (Why is no real title available?)
- scientific article; zbMATH DE number 1128827 (Why is no real title available?)
- Bounds on optimal values in stochastic scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- Rearrangement, Majorization and Stochastic Scheduling
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Stochastic Scheduling with Release Dates and Due Dates
- The stochastic single machine scheduling problem with earliness and tardiness costs
Cited in
(34)- A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
- Trading off due-date tightness and job tardiness in a basic scheduling model
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- scientific article; zbMATH DE number 96059 (Why is no real title available?)
- Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
- Distributionally robust single machine scheduling with risk aversion
- Scheduling of multiple R\&D-Projects in a dynamic and stochastic environment
- Safe scheduling: Setting due dates in single-machine problems
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
- Multiple server preemptive scheduling with impatience
- Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
- Minimizing earliness and tardiness costs in stochastic scheduling
- scientific article; zbMATH DE number 6677416 (Why is no real title available?)
- Stability of scheduling with random processing times on one machine
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Forecasting policies for scheduling a stochastic due date job shop
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
- Single machine scheduling under market uncertainty
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Optimal static priority rules for stochastic scheduling with impatience
- Solving a stochastic single machine problem with initial idle time and quadratic objective
- Stochastic scheduling to minimize expected maximum lateness
- Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem
- scientific article; zbMATH DE number 5547843 (Why is no real title available?)
- Bi-objective single machine scheduling problem with stochastic processing times
- A stochastic single machine scheduling with random processing time
- Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
- Modeling the dynamics of a multi-product manufacturing system: a real case application
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
- Setting optimal due dates in a basic safe-scheduling model
- Scheduling with compressible and stochastic release dates
- Dynamic single-machine scheduling under distributed decision-making
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
This page was built for publication: Dynamic scheduling of stochastic jobs on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600933)
