An approximation algorithm for parallel machine scheduling with a common server
From MaRDI portal
Publication:4658402
DOI10.1057/palgrave.jors.2601074zbMath1131.90364OpenAlexW2046609527MaRDI QIDQ4658402
Cheng, T. C. Edwin, Guoqing Wang
Publication date: 16 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601074
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Scheduling jobs with equal processing times and a single server on parallel identical machines, An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times, SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS, Minimizing total weighted completion time approximately for the parallel machine problem with a single server, A survey of scheduling problems with setup times or costs, MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server, Complexity results for flow-shop problems with a single server, Parallel machine scheduling with multiple unloading servers, Online algorithms for scheduling two parallel machines with a single server, Parallel Machine Scheduling with a Single Server: Loading and Unloading, Single-server parallel-machine scheduling with loading and unloading times
