Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 51, Issue 3, Pages 772-779Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2012.663945
Keywords
scheduling; heuristics; flow shop; earliness and tardiness
Ask authors/readers for more resources
This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the problem. This procedure and five other procedures were tested on problem sets that varied in terms of number of jobs, machines and the tightness and range of due dates. It was found that the genetic algorithm procedure was consistently effective in generating good solutions relative to the other procedures.
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