Approximate algorithms for the \(P\parallel C_{\max}\) problem

DOI10.1007/BF02568517zbMath0887.90085OpenAlexW2046046286MaRDI QIDQ1367883

Bernhard Rupp

Publication date: 6 May 1998

Published in: Top (Search for Journal in Brave)

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

zbMATH Keywords

heuristic algorithmsidentical parallel machinesindependent and nonpreemptable jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

List scheduling algorithms to minimize the makespan on identical parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• The rate of convergence to optimality of the LPT rule
• Fast algorithms for bin packing
• Scheduling with Deadlines and Loss Functions
• Optimal two- and three-stage production schedules with setup times included
• The Asymptotic Optimality of the LPT Rule
• An Application of Bin-Packing to Multiprocessor Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Bounds for Certain Multiprocessing Anomalies
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

This page was built for publication: Approximate algorithms for the \(P\parallel C_{\max}\) problem