Parallel Scheduling Algorithms

DOI10.1287/OPRE.31.1.24MaRDI QIDQ3959729zbMATH OpenOpenAlexFDO

Authors Eliezer Dekel, Sartaj 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

zbMATH Keywords

channel assignmentjob sequencing with deadlinesminimization of earliness/tardiness penaltiesminimization of mean completion timeminimization of tardy jobs numberparallel algorithmsshared memory model

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35)

Cited in

(11)

• 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
• 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 Functions¹
• On the complexity of scheduling unrelated parallel machines with limited preemptions

This page was built for publication: Parallel Scheduling Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959729)