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

DOI10.1111/j.1475-3995.2007.00605.xzbMath1135.90346OpenAlexW2105222081MaRDI 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

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

A characterization of optimal multiprocessor schedules and new dominance rules ⋮ A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Two branch-and-bound algorithms for the robust parallel machine scheduling problem ⋮ Heuristics and exact methods for number partitioning

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

This page was built for publication: Tight bounds for the identical parallel machine‐scheduling problem: Part II