期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 125, 期 -, 页码 1-8出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.08.008
关键词
Scheduling; Job shop; Metaheuristic; Availability constraints; Disjunctive graph
资金
- ANRT (Association Nationale de la Recherche Technique) [2015/1455]
- CIFRE funds
- STMicroelectronics
- Mines Saint-Etienne
This paper addresses the job-shop scheduling problem in which the machines are not available during the whole planning horizon and with the objective of minimizing the makespan. The disjunctive graph model is used to represent job sequences and to adapt and extend known structural properties of the classical job-shop scheduling problem to the problem at hand. These results have been included in two metaheuristics (Simulated Annealing and Tabu Search) with specific neighborhood functions and diversification structures. Computational experiments on problem instances of the literature show that our Tabu Search approach outperforms Simulated Annealing and existing approaches.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据