Fixed order scheduling with deadlines

DOI10.1016/J.ORL.2025.107306MaRDI QIDQ6931702zbMATH OpenFDO

Authors André Berger, Arman Rouhani, Marc Schröder

Publication date 10 September 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2025.107306

zbMATH Keywords

approximation algorithmsbin packingfixed orderschedulingset cover

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites work

• A linear programming approach for aircraft boarding strategy
• Algorithms and Computation
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• Fixed-order scheduling on parallel machines
• scientific article; zbMATH DE number 1106353 (Why is no real title available?)
• scientific article; zbMATH DE number 2163021 (Why is no real title available?)
• Minimizing the number of machines for scheduling jobs with equal processing times
• Minimizing total completion time with machine-dependent priority lists
• On the minimum number of processors for scheduling problems with communication delays
• Perishable Inventory Theory: A Review
• Procedures for the bin packing problem with precedence constraints
• Scheduling with a minimum number of machines

This page was built for publication: Fixed order scheduling with deadlines

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