期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 120, 期 2, 页码 297-310出版社
ELSEVIER
DOI: 10.1016/S0377-2217(99)00158-7
关键词
production scheduling; jobshop; heuristics; tabu search
A computationally effective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. The proposed local search method is based on a tabu search technique and on the shifting bottleneck procedure used to generate the initial solution and to refine the next-current solutions. Computational experiments on a standard set of problem instances show that, in several cases, our approach, in a reasonable amount of computer time, yields better results than the other heuristic procedures discussed in the literature. (C) 2000 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据