.png){kind=icon}
返回
A tabu search algorithm for scheduling pharmaceutical packaging operations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2009.05.038.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses a practical scheduling problem arising in the packaging department of a pharmaceutical industrial plant. The problem is modeled as a multi-purpose machine scheduling problem with setup and removal times, release and due dates and additional constraints related to the scarce availability of tools and human operators. The objective functions are minimization of makespan and maximum tardiness in lexicographic order. Representing a solution with a directed graph allows us to devise an effective tabu search algorithm to solve the problem. Computational experiments, carried on real and randomly generated instances, show the effectiveness of this approach. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Packaging
Tabu search
Pharmaceutical industry
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times具有序列相关设置时间的多处理器调度问题的禁忌搜索启发式方法
PREAI
分享收藏分享收藏
查看更多内容