Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
From MaRDI portal
Publication:1861922
DOI10.1023/A:1021569406280zbMath1027.90032OpenAlexW80243447MaRDI QIDQ1861922
Ethel Mokotoff, José Luis Jimeno
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021569406280
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem ⋮ An exact algorithm for the identical parallel machine scheduling problem. ⋮ Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates
This page was built for publication: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
