Optimal Scheduling of Tasks on Identical Parallel Processors
From MaRDI portal
Publication:4896446
DOI10.1287/ijoc.7.2.191zbMath0859.90081MaRDI QIDQ4896446
Mauro Dell'Amico, Silvano Martello
Publication date: 25 March 1997
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.2.191
scheduling; branch-and-bound; lower bounds; approximation algorithms; maximum completion time; identical parallel processors
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Metaheuristics for the vehicle routing problem with loading constraints, Bounds for the cardinality constrained \(P \|C_{max}\) problem, Minimizing makespan subject to minimum flowtime on two identical parallel machines, Recent advances on two-dimensional bin packing problems, Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, Maximizing the minimum completion time on parallel machines, Properties of some ILP formulations of a class of partitioning problems, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, Two-dimensional packing problems: a survey, An analysis of lower bound procedures for the bin packing problem, Minimizing labor requirements in a periodic vehicle loading problem, Fast lifting procedures for the bin packing problem, Tight bounds for the identical parallel machine scheduling problem, Tight bounds for the identical parallel machine‐scheduling problem: Part II
