Tight bounds for the identical parallel machine‐scheduling problem: Part II

DOI10.1111/j.1475-3995.2007.00605.xzbMath1135.90346MaRDI QIDQ3502134

Mohamed Haouari, Mahdi Jemmali

Publication date: 22 May 2008

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.2007.00605.x

zbMATH Keywords

lower bounds

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Relaxations and exact solution of the variable sized bin packing problem, Heuristics and exact methods for number partitioning, Two branch-and-bound algorithms for the robust parallel machine scheduling problem

Cites Work

• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• An exact algorithm for the identical parallel machine scheduling problem.
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• Improving Discrete Model Representations via Symmetry Considerations
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Tight bounds for the identical parallel machine scheduling problem
• Optimal Scheduling of Tasks on Identical Parallel Processors