Heuristics for scheduling unrelated parallel machines

DOI10.1016/0305-0548(91)90034-OzbMath0723.90038OpenAlexW2004671277MaRDI QIDQ2276868

A. M. A. Hariri, Chris N. Potts

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90034-o

zbMATH Keywords

unrelated parallel machinesmaximum completion timenon-preemptively scheduling jobstwo-phase heuristics

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Unrelated parallel machine scheduling using local search, A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search, Exact and approximation algorithms for makespan minimization on unrelated parallel machines, A comparison of local search methods for flow shop scheduling, Scheduling unrelated parallel machines with sequence-dependent setups, Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems, A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization, An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines, Processing time generation schemes for parallel machine scheduling problems with various correlation structures, Unrelated parallel machine scheduling -- perspectives and progress, Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach, Iterated greedy local search methods for unrelated parallel machine scheduling, Planning production using mathematical programming: The case of a woodturning company, Scheduling MapReduce jobs on identical and unrelated processors, Heuristics for unrelated machine scheduling with precedence constraints, Workload balancing and loop layout in the design of a flexible manufacturing system, A cutting plane algorithm for the unrelated parallel machine scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A new polynomial-time algorithm for linear programming
• Worst-case analysis of a scheduling algorithm
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Future paths for integer programming and links to artificial intelligence
• Worst-Case Analysis of Heuristic Algorithms
• Algorithms for Scheduling Tasks on Unrelated Processors
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Performance Guarantees for Scheduling Algorithms
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors