A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem
A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem
复制标题
DOI：
10.1080/00207543.2010.526016
复制
发表时间：
2011-01
影响因子：
9.2
通讯作者：
Geoffrey Vilcot;J. Billaut
中科院分区：
文献类型：
--
作者：
Geoffrey Vilcot;J. Billaut
本文所考虑的问题是印刷制版行业的柔性作业车间调度问题。两个标准必须最小化，最大完工时间和最大延迟。两个禁忌搜索算法提出了一组非支配的解决方案：第一个是基于最小化的一个标准受到第二个标准（ε-约束方法）的约束，第二个是基于最小化的线性组合的标准。这些算法进行了测试，从文献中的基准实例和结果进行了讨论。总延误被认为是第二禁忌搜索和结果的第三个标准。
The problem that we consider in this article is a flexible job shop scheduling problem issued from the printing and boarding industry. Two criteria have to be minimised, the makespan and the maximum lateness. Two tabu search algorithms are proposed for finding a set of non-dominated solutions: the first is based on the minimisation of one criterion subject to a bound on the second criterion (ε-constraint approach) and the second is based on the minimisation of a linear combination of criteria. These algorithms are tested on benchmark instances from the literature and the results are discussed. The total tardiness is considered as a third criterion for the second tabu search and results are presented and discussed.