Parallel machine scheduling problems with a single server

Authors:
S. A. Kravchenko;F. Werner
Affiliations:
Institute of Engineering Cybernetics Surganova St. 6, 220012 Minsk, Belarus;Otto-von-Guericke-Universität Magdeburg Postfach 4120, 39016 Magdeburg, Germany
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1997

Citing 1
Cited 13

Scheduling two parallel semiautomatic machines to minimize machine interference

Computers and Operations Research

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

Computers and Operations Research
Scheduling a single server in a two-machine flow shop

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

Computers and Operations Research
Total completion time minimization in a computer system with a server and two parallel processors

Computers and Operations Research
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
A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates

Robotics and Computer-Integrated Manufacturing
Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server

Computers and Industrial Engineering
Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

Computers and Operations Research
Scheduling with multiple servers

Automation and Remote Control
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
Online LPT algorithms for parallel machines scheduling with a single server

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.98

Visualization

Abstract

In this paper, we consider the problem of scheduling jobs on parallel machines with setup times. The setup has to be performed by a single server. The objective is to minimize the schedule length (makespan), as well as the forced idle time. The makespan problem is known to be NP-hard even for the case of two identical parallel machines. This paper presents a pseudopolynomial algorithm for the case of two machines when all setup times are equal to one. We also show that the more general problem with an arbitrary number of machines is unary NP-hard and analyze some list scheduling heuristics for this problem. The problem of minimizing the forced idle time is known to be unary NP-hard for the case of two machines and arbitrary setup and processing times. We prove unary NP-hardness of this problem even for the case of constant setup times. Moreover, some polynomially solvable cases are given.