.png){kind=icon}
返回
Open shop cyclic scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2018.02.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper deals with cyclic scheduling problem in the production system working according to the so called open shop policy. The considered case is more general than standard open-shop and job-shop scheduling problems discussed so far in operations research literature. The proposed approach is a nontrivial extension of the permutation-and-graph modelling technology introduced earlier by us for job-shop scheduling. In this paper we provide a mathematical model of the problem and a few graph models. Using these graphs, we formulate several properties employed in the time-efficient method of finding minimal cycle time for the given processing orders. Then, we prove graph properties useful for the elimination of a priori unfeasible or inferior solutions without direct calculation of cycle time. Based on the established theoretical properties, we propose an approximation algorithm of tabu search type. Empirical tests confirm high efficiency of the algorithm. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Open shop
Job shop
Cycle time
Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容