Throughput scheduling with equal additive laxity
- 28 June 2022
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 50 (5) , 463-469
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Dynamic courier routing for a food delivery serviceComputers & Operations Research, 2019
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slackJournal of Scheduling, 2016
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling ProblemsMathematics of Operations Research, 2006
- A Note on Scheduling Equal-Length Jobs to Maximize ThroughputJournal of Scheduling, 2006
- Approximating the Throughput of Multiple Machines in Real-Time SchedulingSIAM Journal on Computing, 2001
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing timesJournal of Scheduling, 1999
- On the approximability of an interval scheduling problemJournal of Scheduling, 1999
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due TimesOperations Research, 1978
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977