Tight bounds for the identical parallel machine scheduling problem

DOI10.1111/j.1475-3995.2006.00562.xzbMath1135.90015MaRDI QIDQ3429035

Mohamed Haouari, Anis Gharbi, Mahdi Jemmali

Publication date: 30 March 2007

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00562.x

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Maximizing the minimum completion time on parallel machines, Heuristics and exact methods for number partitioning, Tight bounds for the identical parallel machine‐scheduling problem: Part II

Cites Work

• Lower bounds for scheduling on identical parallel machines with heads and tails
• A general lower bound for the makespan problem
• Design and evaluation of tabu search algorithms for multiprocessor scheduling
• Local search metaheuristics for discrete-continuous scheduling problems
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• Applying tabu search with influential diversification to multiprocessor scheduling
• An exact algorithm for the identical parallel machine scheduling problem.
• Dynamic programming on the word RAM
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• Improving local search heuristics for some scheduling problems. I
• Fast lifting procedures for the bin packing problem
• Algorithms for Scheduling Independent Tasks
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Improving local search heuristics for some scheduling problems. II