A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
From MaRDI portal
Publication:4729336
DOI10.1137/0218048zbMath0679.68057OpenAlexW2081140665MaRDI QIDQ4729336
Barbara B. Simons, Manfred K. Warmuth
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218048
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem ⋮ Vehicle scheduling in two-cycle flexible manufacturing systems ⋮ Scheduling Equal-Length Jobs with Delivery times on Identical Processors ⋮ Variants of Multi-resource Scheduling Problems with Equal Processing Times ⋮ Theoretical expectation versus practical performance of Jackson's heuristic ⋮ Parallel batch scheduling of equal-length jobs with release and due dates ⋮ Open shop problems with unit time operations ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ Finding total unimodularity in optimization problems solved by linear programs ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ Parallel machine problems with equal processing times: a survey ⋮ A model for minimizing active processor time ⋮ Ideal schedules in parallel machine settings ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ On a parallel machine scheduling problem with equal processing times ⋮ Minimizing the number of machines for scheduling jobs with equal processing times ⋮ Minimizing makespan on parallel machines subject to release dates and delivery times
