Scheduling parallel machines with a single server: some solvable cases and heuristics

Authors:
Amir H. Abdekhodaee;Andrew Wirth
Affiliations:
Department of Mechanical and Manufacturing Engineering, The University of Melbourne, Vic, Australia;Department of Mechanical and Manufacturing Engineering, The University of Melbourne, Vic, Australia
Venue:
Computers and Operations Research
Year:
2002

Citing 5
Cited 10

Scheduling two parallel semiautomatic machines to minimize machine interference

Computers and Operations Research
Parallel machine scheduling with a common server

Discrete Applied Mathematics
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallel machine scheduling problems with a single server

Mathematical and Computer Modelling: An International Journal

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

Computers and Operations Research
Scheduling two parallel machines with a single server: the general case

Computers and Operations Research
Two-machine flow shop problems with a single server

Journal of Scheduling
On-line scheduling of two parallel machines with a single server

Computers and Operations Research
Scheduling reentrant jobs on parallel machines with a remote server

Computers and Operations Research
Scheduling two parallel machines with a single server: the general case

Computers and Operations Research
Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server

Computers and Industrial Engineering
A branch-and-price algorithm for the general case of scheduling parallel machines with a single server

Computers and Operations Research
MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

Computers and Operations Research
Preemptive scheduling on two parallel machines with a single server

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the problem of scheduling two identical parallel machines with a single server which is required to carry out the job setups. Job processing can then be carried out in parallel. The objective is to minimise maximum completion time, that is makespan. The problem is NP-complete in the strong sense. An integer program formulation is presented. Two special cases: short processing times and equal length jobs are solved. Two simple but effective O(n log n) heuristics for the general case are given and their performance is tested.