Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
From MaRDI portal
Publication:2884532
DOI10.1287/ijoc.14.2.175.119zbMath1238.90071OpenAlexW2100628049MaRDI QIDQ2884532
Tjark Vredeveld, Cor A. J. Hurkens
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f3b76843ec1af5102f18b0436d3bad0d92d07194
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (10)
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ Processing time generation schemes for parallel machine scheduling problems with various correlation structures ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
Uses Software
This page was built for publication: Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
