Throughput scheduling with equal additive laxity
From MaRDI portal
Publication:5925675
DOI10.1007/978-3-030-75242-2_9OpenAlexW3157279431MaRDI QIDQ5925675
Martin Böhm, Nicole Megow, Jens Schlöter
Publication date: 22 March 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_9
Related Items (1)
Cites Work
- 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
This page was built for publication: Throughput scheduling with equal additive laxity
