SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS

DOI10.1017/S1446181117000141zbMath1373.90059OpenAlexW2619154373MaRDI QIDQ5370786

Yiwei Jiang, Ping Zhou, Jueliang Hu, Hui-Juan Wang

Publication date: 20 October 2017

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181117000141

zbMATH Keywords

algorithmschedulingmakespanworst-case ratioserver

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

General variable neighborhood search for the parallel machine scheduling problem with two common servers

Cites Work

• Online LPT algorithms for parallel machines scheduling with a single server
• Scheduling with multiple servers
• On-line scheduling of two parallel machines with a single server
• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with multiple unloading servers
• Parallel machine scheduling with a common server
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
• Complexity results for parallel machine problems with a single server
• Single-server parallel-machine scheduling with loading and unloading times
• Scheduling two parallel semiautomatic machines to minimize machine interference
• 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
• An approximation algorithm for parallel machine scheduling with a common server

This page was built for publication: SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS