Stochastic scheduling to minimize expected maximum lateness
From MaRDI portal
Publication:2482822
Recommendations
- Dynamic scheduling of stochastic jobs on a single machine
- Single-machine scheduling to stochastically minimize maximum lateness
- A stochastic single machine scheduling with random processing time
- Scheduling stochastic jobs with due dates on parallel machines
- One machine scheduling to minimize expected mean tardiness. II
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- General stochastic single-machine scheduling with regular cost functions
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Preemptive Scheduling with Due Dates
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- Preemptive scheduling with staircase and piecewise linear resource availability
- Scheduling unit-time tasks with integer release times and deadlines
- Single-machine scheduling with exponential processing times and general stochastic cost functions
- Some simple scheduling algorithms
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
Cited in
(22)- Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
- scientific article; zbMATH DE number 96059 (Why is no real title available?)
- Stochastic Flow-Shop Scheduling with Lateness-Related Performance Measures
- Distributionally robust single machine scheduling with risk aversion
- Safe scheduling: Setting due dates in single-machine problems
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Minimizing earliness and tardiness costs in stochastic scheduling
- Target-based distributionally robust optimization for single machine scheduling
- Forecasting policies for scheduling a stochastic due date job shop
- Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
- An uncertain programming model for single machine scheduling problem with batch delivery
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
- A stochastic JIT scheduling problem
- Robust scheduling on a single machine to minimize total flow time
- Scheduling multi-mode projects under uncertainty to optimize cash flows: a Monte Carlo ant colony system approach
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Single-machine scheduling to stochastically minimize maximum lateness
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
- Setting due dates in a stochastic single machine environment
- Scheduling with compressible and stochastic release dates
- A clearing function based bid-price approach to integrated order acceptance and release decisions
- Inverse scheduling with maximum lateness objective
This page was built for publication: Stochastic scheduling to minimize expected maximum lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482822)
