An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times
From MaRDI portal
Publication:2931175
DOI10.1142/S0217595914500390zbMath1299.90149MaRDI QIDQ2931175
Ping Zhou, Yiwei Jiang, Hui-Juan Wang
Publication date: 24 November 2014
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Related Items (2)
SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS ⋮ Online algorithms for scheduling two parallel machines with a single server
Cites Work
- Online LPT algorithms for parallel machines scheduling with a single server
- Scheduling with multiple servers
- Sequencing and scheduling in robotic cells: recent developments
- 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
- Design and operational issues in AGV-served manufacturing systems
- Parallel machine scheduling with a common server
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single 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
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- Scheduling two parallel semiautomatic machines to minimize machine interference
- Scheduling two parallel machines with a single server: the general case
- An approximation algorithm for parallel machine scheduling with a common server
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
This page was built for publication: An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times
