Stochastic scheduling to minimize expected maximum lateness
From MaRDI portal
Publication:2482822
DOI10.1016/J.EJOR.2007.06.015zbMath1146.90431OpenAlexW2018634397MaRDI QIDQ2482822
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.015
Related Items (10)
Scheduling multi-mode projects under uncertainty to optimize cash flows: a Monte Carlo ant colony system approach ⋮ Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ A clearing function based bid-price approach to integrated order acceptance and release decisions ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ A novel parallel quantum genetic algorithm for stochastic job shop scheduling ⋮ An uncertain programming model for single machine scheduling problem with batch delivery ⋮ Target-based distributionally robust optimization for single machine scheduling ⋮ A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- General stochastic single-machine scheduling with regular cost functions
- Single-machine scheduling with exponential processing times and general stochastic cost functions
- Scheduling unit-time tasks with integer release times and deadlines
- Preemptive scheduling with staircase and piecewise linear resource availability
- Preemptive Scheduling with Due Dates
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Some simple scheduling algorithms
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Stochastic scheduling to minimize expected maximum lateness