A note on scheduling equal-length jobs to maximize throughput

DOI10.1007/s10951-006-5595-4zbMath1154.90430arXivcs/0410046OpenAlexW1923579438MaRDI QIDQ880531

Maciej Kurowski, Wojciech Jawor, Łukasz Kowalik, Christoph Dürr, Marek Chrobak

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0410046

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs, A note on scheduling equal-length jobs to maximize throughput, A survey of single machine scheduling to minimize weighted number of tardy jobs, Primal-dual analysis for online interval scheduling problems, Branch less, cut more and minimize the number of late equal-length jobs on identical machines, A study of single-machine scheduling problem to maximize throughput, Fast solution of single-machine scheduling problem with embedded jobs, On maximum bipartite matching with separation, Parallel machine problems with equal processing times: a survey, Scheduling two agents on uniform parallel machines with~makespan and cost functions, Dispersing points on intervals, Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem, A decomposition scheme for single stage scheduling problems, Throughput scheduling with equal additive laxity, Throughput scheduling with equal additive laxity, Two-agent scheduling on uniform parallel machines with min-max criteria, Priority algorithms for the subset-sum problem

Cites Work

• A note on scheduling equal-length jobs to maximize throughput
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines