Equal processing and equal setup time cases of scheduling parallel machines with a single server

DOI10.1016/S0305-0548(03)00144-8zbMath1068.68030MaRDI QIDQ1885956

Andrew Wirth, Amir H. Abdekhodaee, Heng-Soon Gan

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Parallel machinesSetupSingle server

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Mixed integer programming formulations for the biomass truck scheduling problem, 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, An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times, Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen, Scheduling with machine conflicts, A survey of scheduling problems with setup times or costs, Pure cycles in flexible robotic cells, On-line scheduling of two parallel machines with a single 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, Parallel machine scheduling with multiple unloading servers, Fast LP models and algorithms for identical jobs on uniform parallel machines, Online algorithms for scheduling two parallel machines with a single server, Scheduling two parallel machines with a single server: the general case, Parallel Machine Scheduling with a Single Server: Loading and Unloading, Single-server parallel-machine scheduling with loading and unloading times

Cites Work

• Unnamed Item
• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with a common server
• Scheduling with safety distances
• Scheduling two parallel semiautomatic machines to minimize machine interference
• Scheduling parallel machines with a single server: Some solvable cases and heuristics