.png){kind=icon}
返回
Minimum makespan task sequencing with multiple shared resources
.png){kind=icon}
PRE
AI
DOI：10.1016/j.rcim.2003.10.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we study the general problem of sequencing multiple jobs, where each job consists of multiple ordered tasks and tasks execution requires simultaneous usage of several resources. In particular, the case of an automatic assembly cell is examined. NP-completeness results are given. A heuristic is designed and evaluated. (C) 2003 Elsevier Ltd. All rights reserved.
Keyword:
scheduling
robotic cells
job shop heuristic algorithm
complexity analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
R
IF:
11.4
论文数:
3.3K
被引数:
1.3W
机构
暂无机构信息
引用论文
Rapid improvement of coagulopathy by all‐trans retinoic acid in acute promyelocytic leukemia全反式维甲酸快速改善急性早幼粒细胞白血病凝血功能
PREAI
分享收藏The healing of N-vacancy in boron nitride nanotube by using NO and NO2 molecules: a density functional theoretical study利用NO和NO2分子修复氮化硼纳米管中N空位的密度泛函理论研究.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏Modeling and Optimization of Friction Stir Welding Parameters for Joining Dissimilar Aluminum Alloys
OAAI
OAAI分享收藏
查看更多内容