Solving the serial batching problem in job shop manufacturing systems
Solving the serial batching problem in job shop manufacturing systems
复制标题
DOI：
10.1016/j.ejor.2012.03.001
复制
发表时间：
2012-08
期刊：
影响因子：
--
通讯作者：
Liji Shen;U. Buscher
中科院分区：
文献类型：
--
作者：
Liji Shen;U. Buscher
本文解决了嵌入作业车间环境中的串行批量调度问题，以最大限度地缩短完工时间。还考虑了顺序相关的家庭设置时间和工作可用性假设。考虑到批处理决策，我们提出了一种禁忌搜索算法，该算法由各种邻域函数、多个禁忌列表和复杂的多样化结构组成。计算实验表明，我们的算法优于众所周知的禁忌搜索方法，该方法是为解决传统作业车间问题而开发的。这些结果也证实了批处理的好处。
This paper addresses the serial batch scheduling problem embedded in a job shop environment to minimize makespan. Sequence dependent family setup times and a job availability assumption are also taken into account. In consideration of batching decisions, we propose a tabu search algorithm which consists of various neighborhood functions, multiple tabu lists and a sophisticated diversification structure. Computational experiments show that our algorithm outperforms a well-known tabu search approach which is developed for solving the traditional job shop problem. These results also confirm the benefits of batching.