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

DOI10.1016/J.COR.2024.106542MaRDI QIDQ6551145zbMATH OpenFDO

Authors Martin Branda, Monika Matoušková

Publication date 6 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106542

zbMATH Keywords

fixed interval schedulingjob classesLagrangian relaxationnon-identical machinesuncertain delays

Mathematics Subject Classification ID

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

Cites work

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

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)