An approximation algorithm for parallel machine scheduling with a common server

DOI10.1057/PALGRAVE.JORS.2601074MaRDI QIDQ4658402zbMATH OpenOpenAlexFDO

Authors G. Wang, T. C. Edwin Cheng

Publication date 16 March 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601074

zbMATH Keywords

approximation algorithmworst-case analysisparallel machine scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Parallel machine scheduling with a common server
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server
• Scheduling with multiple servers
• scientific article; zbMATH DE number 1497368
• Scheduling parallel machines with a single server: Some solvable cases and heuristics

Cited in

(14)

• Online algorithms for scheduling two parallel machines with a single server
• An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
• Scheduling jobs with equal processing times and a single server on parallel identical machines
• Minimization of maximum lateness on parallel machines with a single server and job release dates
• Parallel machine scheduling with multiple unloading servers
• A survey of scheduling problems with setup times or costs
• Parallel machine scheduling with a single server: loading and unloading
• Parallel machine scheduling with a common server
• Complexity results for flow-shop problems with a single server
• Scheduling on two parallel machines with two dedicated servers
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
• Single-server parallel-machine scheduling with loading and unloading times
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server

This page was built for publication: An approximation algorithm for parallel machine scheduling with a common server

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658402)