Parallel Scheduling Algorithms
From MaRDI portal
Publication:3959729
DOI10.1287/opre.31.1.24zbMath0495.90045MaRDI QIDQ3959729
Eliezer Dekel, Sartaj K. Sahni
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.1.24
parallel algorithms; channel assignment; shared memory model; job sequencing with deadlines; minimization of mean completion time; minimization of earliness/tardiness penalties; minimization of tardy jobs number
65K10: Numerical optimization and variational techniques
90B35: Deterministic scheduling theory in operations research
Related Items
Parallel computation on interval graphs: algorithms and experiments, AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER, AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER∗, single Machine Preemptive Scheduling With Special Cost Functions1, On the complexity of scheduling unrelated parallel machines with limited preemptions, An introduction to parallelism in combinatorial optimization, Some parallel algorithms on interval graphs, On problem transformability in VLSI, An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model, A simple optimal parallel algorithm for the minimum coloring problem on interval graphs, PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
