Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 15, Issue 1, Pages 103-115Publisher
SPRINGER
DOI: 10.1023/B:JIMS.0000010078.30713.e9
Keywords
scheduling; flexible job shop; due dates; heuristic; tabu search
Ask authors/readers for more resources
This paper addresses the problem of scheduling jobs in a flexible job shop with the objective of minimizing total tardiness. The flexible job shop differs from the classical job shop in that each of the operations associated with a job can be processed on any of a set of alternative machines. Two heuristics based on tabu search are developed for this problem: a hierarchical procedure and a multiple start procedure. The procedures use dispatching rules to obtain an initial solution and then search for improved solutions in neighborhoods generated by the critical paths of the jobs in a disjunctive graph representation. Diversification strategies are also implemented and tested. The outcomes of extensive computational results are reported.
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