Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 46, Issue 22, Pages 6479-6498Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540701418960
Keywords
scheduling; flow shop; due dates; greedy algorithm
Categories
Funding
- University of Duisburg-Essen (Germany)
Ask authors/readers for more resources
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of minimizing the total tardiness of jobs. To tackle this problem, it is suggested that a procedure based on a greedy algorithm is employed that successively iterates over an increasing number of candidate solutions. The computational experiments carried out show this algorithm outperforms the best existing one for the problem under consideration. In addition, out some tests are carried out to analyse the efficiency of the adopted design.
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