Parallel Scheduling Algorithms
From MaRDI portal
Publication:3959729
DOI10.1287/opre.31.1.24zbMath0495.90045OpenAlexW2054806836MaRDI 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 algorithmschannel assignmentshared memory modeljob sequencing with deadlinesminimization of mean completion timeminimization of earliness/tardiness penaltiesminimization of tardy jobs number
Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
An introduction to parallelism in combinatorial optimization ⋮ Parallel computation on interval graphs: algorithms and experiments ⋮ PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA ⋮ Some parallel algorithms on interval graphs ⋮ On problem transformability in VLSI ⋮ 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∗ ⋮ On the complexity of scheduling unrelated parallel machines with limited preemptions ⋮ single Machine Preemptive Scheduling With Special Cost Functions1 ⋮ 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
This page was built for publication: Parallel Scheduling Algorithms
