Heuristics for scheduling unrelated parallel machines

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

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

Publication date: 1991

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

zbMATH Keywords

unrelated parallel machines; maximum completion time; non-preemptively scheduling jobs; two-phase heuristics

Mathematics Subject Classification ID

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines, Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems, Scheduling unrelated parallel machines with sequence-dependent setups, Iterated greedy local search methods for unrelated parallel machine scheduling, Planning production using mathematical programming: The case of a woodturning company, Heuristics for unrelated machine scheduling with precedence constraints, 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, Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach, Workload balancing and loop layout in the design of a flexible manufacturing system, A cutting plane algorithm for the unrelated parallel machine scheduling problem, A comparison of local search methods for flow shop scheduling

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