A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes

Integer programming (90C10) Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36) Operations research and management science (90Bxx)

Cites Work

Tactical fixed job scheduling with spread-time constraints
Optimal interval scheduling with a resource constraint
On the complexity of interval scheduling with a resource constraint
Fixed interval scheduling: models, applications, computational complexity and algorithms
On the computational complexity of (maximum) class scheduling
Exact and approximation algorithms for the operational fixed interval scheduling problem
Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
Parallel machine scheduling with time constraints on machine qualifications
Flow-based formulations for operational fixed interval scheduling problems with random delays
Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Optimizing multiple qualifications of products on non-identical parallel machines
Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
A data-driven flight schedule optimization model considering the uncertainty of operational displacement
Interval scheduling: A survey
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Application of a risk-averse objective function for scheduling surgeries
Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization

This page was built for publication: A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551145)