List scheduling algorithms to minimize the makespan on identical parallel machines

DOI10.1007/BF02579085zbMath1024.90043OpenAlexW2002575139MaRDI QIDQ1348708

Ethel Mokotoff, Ana Isabel Gutiérrez, José Luis Jimeno

Publication date: 14 May 2002

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579085

zbMATH Keywords

list schedulingheuristic algorithmsparallel machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem ⋮ An exact algorithm for the identical parallel machine scheduling problem. ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions

Cites Work

• Unnamed Item
• The rate of convergence to optimality of the LPT rule
• A survey of priority rule-based scheduling
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• Applying tabu search with influential diversification to multiprocessor scheduling
• Approximate algorithms for the \(P\parallel C_{\max}\) problem
• NP-hardness of shop-scheduling problems with three jobs
• Scheduling with Deadlines and Loss Functions
• Scheduling Independent Tasks on Uniform Processors
• The Asymptotic Optimality of the LPT Rule
• Bounds on Schedules for Independent Tasks with Similar Execution Times
• On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints
• A Survey of Scheduling Rules
• An Application of Bin-Packing to Multiprocessor Scheduling
• Combinatorial Problems: Reductibility and Approximation
• Computational Complexity of Discrete Optimization Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
• On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• The complexity of theorem-proving procedures

This page was built for publication: List scheduling algorithms to minimize the makespan on identical parallel machines