期刊
JOURNAL OF INTELLIGENT MANUFACTURING
卷 15, 期 1, 页码 103-115出版社
SPRINGER
DOI: 10.1023/B:JIMS.0000010078.30713.e9
关键词
scheduling; flexible job shop; due dates; heuristic; tabu search
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据