Throughput scheduling with equal additive laxity

DOI10.1016/j.orl.2022.06.007OpenAlexW4283687665MaRDI QIDQ5918523

Nicole Megow, Jens Schlöter, Martin Böhm

Publication date: 17 October 2022

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

Full work available at URL: https://doi.org/10.1016/j.orl.2022.06.007

zbMATH Keywords

dynamic programmingapproximation algorithms for schedulingthroughput schedulingadditive laxity

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on scheduling equal-length jobs to maximize throughput
• Dynamic courier routing for a food delivery service
• On the approximability of an interval scheduling problem
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Single courier single restaurant meal delivery (without routing)
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
• Breaking \(1-1/e\) barrier for non-preemptive throughput maximization
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Open Problems in Throughput Scheduling
• Improvements in throughout maximization for real-time scheduling
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Two-Processor Scheduling with Start-Times and Deadlines
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Throughput scheduling with equal additive laxity