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

Authors:
S. Guirchoun;P. Martineau;J.-C. Billaut
Affiliations:
Laboratoire d'Informatique, Ecole Polytechnique de l'Université de Tours, 64 av J Portalis, 37200 Tours, France and Accellent, 27 rue Michael Faraday, 37170 Chambray les Tours, France;Laboratoire d'Informatique, Ecole Polytechnique de l'Université de Tours, 64 av J Portalis, 37200 Tours, France;Laboratoire d'Informatique, Ecole Polytechnique de l'Université de Tours, 64 av J Portalis, 37200 Tours, France
Venue:
Computers and Operations Research
Year:
2005

Citing 5
Cited 3

Scheduling two parallel semiautomatic machines to minimize machine interference

Computers and Operations Research
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Parallel machine scheduling with a common server

Discrete Applied Mathematics
A heuristic algorithm for minimizing mean flow time with unit setups

Information Processing Letters
Parallel machine scheduling problems with a single server

Mathematical and Computer Modelling: An International Journal

The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time

Computers and Operations Research
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The context of the problem tackled in this paper is a computer system composed by a single server and two identical parallel machines. The processing times on the server are assumed to be unary and the objective is to minimize the total completion time. The papers dealing with scheduling problems with a server generally consider that the setup activities require simultaneously the server and the machine. In this paper, this constraint is not considered and the studied problem is a two-stage hybrid flow shop with no-wait constraint between the two stages. An algorithm that can solve optimally this problem in O(n log(n)) time is proposed. Finally, it is shown that solving this problem optimally leads to an optimal solution to the problem without the no-wait constraint.