Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 99, Issue 1-2, Pages 28-40Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ijpe.2004.12.004
Keywords
flowshop scheduling; bi-criteria; makespan; tardiness
Ask authors/readers for more resources
In this paper, we tackle the problem of makespan minimisation in a permutation flowshop where the maximum tardiness is limited by a given upper bound. Since this problem is known to be NP-hard, we focus our attention on approximate approaches that allow obtaining good heuristic solutions to the problem. We first review the related literature and then propose a new algorithm. The algorithm is found to be competitive with the existing algorithms in terms of quality of the solution as well as in terms of the number of feasible solutions found. (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available