Makespan minimization subject to flowtime optimality on identical parallel machines

Authors:
Chien-Hung Lin;Ching-Jong Liao
Affiliations:
Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, Section 4, Taipei 106, Taiwan and Jin Wen Institute of Technology, Taipei County, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, Section 4, Taipei 106, Taiwan
Venue:
Computers and Operations Research
Year:
2004

Citing 2
Cited 2

On the minimization of the makespan subject to flowtime optimality

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

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

Makespan minimization for multiple uniform machines

Computers and Industrial Engineering
Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the identical parallel machine problem with makespan minimization subject to minimum total flowtime. First, we develop an optimal algorithm to the identical parallel machine problem with the objective of minimizing makespan. To improve the computational efficiency, two implementation techniques, the lower bound calculation and the job replacement rule, are applied. Based on the algorithm, an optimal algorithm, using new lower bounds, to the considered problem is developed. The result of this study can also be used to solve the bicriteria problem of minimizing the weighted sum of makespan and mean flowtime. Computational experiments are conducted up to six machines and 1000 jobs. Although the proposed algorithm has an exponential time complexity, the computational results show that it is efficient to find the optimal solution.