.png){kind=icon}
返回
A fast finite loading algorithm for job oriented scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(96)00035-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Job oriented scheduling (JOS) has been the most commonly used technique in actual job shop settings. It loads jobs one by one onto machines, in which all the operations of a job are scheduled in succession. This article presents a JOS model and formulates a fast finite loading procedure which is the key algorithm of computer-based JOS systems. The algorithm assigns feasible schedule start and finish times to the operations of a job by loading them forward or backward onto the capacity constrained parallel machines. A particular technique is the maintenance of blocks of consecutively scheduled operations on each machine, thereby reducing the search time for finding a feasible time slot for each operation on the corresponding machine. Experimental testing shows that the algorithm has significant computational performance for large size problems. Copyright (C) 1997 Elsevier Science Ltd
Keyword:
RULES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容