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

Authors:
Amir H. Abdekhodaee;Andrew Wirth;Heng Soon Gan
Affiliations:
Operations Research Group, CSIRO Mathematical and Information Sciences, Private Bag 10, Clayton South, MDC 3169, Australia;Department of Mechanical and Manufacturing Engineering, The University of Melbourne, Vic 3010, Australia;Department of Mechanical and Manufacturing Engineering, The University of Melbourne, Vic 3010, Australia
Venue:
Computers and Operations Research
Year:
2004

Citing 5
Cited 7

Scheduling two parallel semiautomatic machines to minimize machine interference

Computers and Operations Research
Parallel machine scheduling with a common server

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling parallel machines with a single server: some solvable cases and heuristics

Computers and Operations Research
Parallel machine scheduling problems with a single server

Mathematical and Computer Modelling: An International Journal

Scheduling two parallel machines with a single server: the general case

Computers and Operations Research
Pure cycles in flexible robotic cells

Computers and Operations Research
On-line scheduling of two 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
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 deterministic problem of scheduling two-operation non-preemptable jobs on two identical semi-automatic machines. A single server is available to carry out the first (or setup) operation. The second operation is executed automatically, without the server. The general problem of makespan minimization is NP-hard in the strong sense. Two special cases which arise in practice, the equal processing times and regular equal setup times problems turn out to be closely linked to the restricted set partitioning problem. This link is used to show that they are NP-hard in the ordinary sense, and to construct a tight lower bound and two highly effective O(n log n) heuristics.