Paper Info
Title
Total completion time minimization in a computer system with a server and two parallel processors
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.
Year
DOI
Venue
2005
10.1016/j.cor.2003.08.007
Computers & OR
Keywords
DocType
Volume
total completion time,setup activity,processing time,total completion time minimization,computer system,optimal solution,Scheduling,n log,single server,Parallel machines,identical parallel machine,Hybrid flow shop,Single server,no-wait constraint,parallel processor,problem optimally
Journal
32
Issue
ISSN
Citations 
3
Computers and Operations Research
8
PageRank 
References 
Authors
0.60
4
3
Name
Order
Citations
PageRank
S. Guirchoun180.60
P. Martineau280.60
J.-C. Billaut3735.79