Optimal and heuristic solution methods for a multiprocessor machine scheduling problem

DOI10.1016/j.cor.2008.12.017zbMath1160.90470OpenAlexW2039202300MaRDI QIDQ1017458

Jacques Renaud, Simon Tremblay, Fayez F. Boctor, Angel Ruiz

Publication date: 19 May 2009

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

Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.017

zbMATH Keywords

schedulingheuristicdecomposition approachmathematical formulation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

The third comprehensive survey on scheduling problems with setup times/costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• An exact algorithm for the identical parallel machine scheduling problem.
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• A survey on statistical bandwidth sharing
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• Parallel Machine Scheduling by Column Generation
• Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
• Complexity of Scheduling under Precedence Constraints
• An Application of Bin-Packing to Multiprocessor Scheduling
• `` Strong NP-Completeness Results
• Solving Parallel Machine Scheduling Problems by Column Generation
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Optimal and heuristic solution methods for a multiprocessor machine scheduling problem