Scheduling problems on two sets of identical machines

DOI10.1007/s00607-003-0011-9zbMath1033.90041OpenAlexW2068718151MaRDI QIDQ1408971

Csanád Imreh

Publication date: 28 September 2003

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-003-0011-9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (8)

Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines ⋮ The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds ⋮ A Family of Scheduling Algorithms for Hybrid Parallel Platforms ⋮ Online scheduling of jobs with favorite machines ⋮ A PTAS for Scheduling Unrelated Machines of Few Different Types ⋮ Selfish load balancing for jobs with favorite machines ⋮ An EPTAS for scheduling on unrelated machines of few different types ⋮ Online scheduling with general machine cost functions

This page was built for publication: Scheduling problems on two sets of identical machines