Linear-Time Algorithms for Scheduling on Parallel Processors
From MaRDI portal
Publication:3939587
DOI10.1287/opre.30.1.116zbMath0481.90048OpenAlexW2038019409MaRDI QIDQ3939587
Publication date: 1982
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.30.1.116
precedence constraintslinear-time algorithmsscheduling n equal-length tasks on m identical parallel processors
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs, A backward approach in list scheduling algorithms for multi-machine tardiness problems, Single processor scheduling with job values depending on their completion times, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, On maximizing the throughput of multiprocessor tasks., A state-of-the-art review of parallel-machine scheduling research, Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, Minimizing the number of tardy jobs with precedence constraints and agreeable due dates, Makespan minimization with OR-precedence constraints, Parallel machine scheduling with a common server, Scheduling unit length jobs with parallel nested machine processing set restrictions, Level scheduling to minimize schedule length on lots of unit-time jobs
