期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 59, 期 4, 页码 537-543出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2010.06.010
关键词
Job-shop scheduling; Availability constraints; Makespan; Disjunctive graph; Taboo thresholding
资金
- Al-Qassim University [SR-D-006-027]
This paper addresses the makespan minimization in a job-shop environment where the machines are not available during the whole planning horizon. The disjunctive graph model is used to represent the schedules and the concept of blocks is generalized to include the unavailability periods of machines. To solve the problem, we develop a taboo thresholding heuristic that uses a new block-based neighborhood function. Some sufficient conditions to eliminate the evaluation of non-improving moves are proposed. Experiments performed on existing problem instances of the literature show the efficiency of the proposed heuristic. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据