.png){kind=icon}
返回
A GRASP approach for makespan minimization on parallel batch processing machines
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-009-0272-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we consider the problem of scheduling a set of identical batch processing machines arranged in parallel. A Greedy Randomized Adaptive Search Procedure (GRASP) approach is proposed to minimize the makespan under the assumption of non-zero job ready times, arbitrary job sizes and arbitrary processing times. Each machine can process simultaneously several jobs as a batch as long as the machine capacity is not violated. The batch processing time is equal to the largest processing time among those jobs in the batch. Similarly, the batch ready time is equal to the largest ready time among those jobs in the batch. The performance of the proposed GRASP approach was evaluated by comparing its results to a lower bound and heuristics published in the literature. Experimental study suggests that the solution obtained from the GRASP approach is superior compared to other heuristics.
Keyword:
Scheduling
GRASP
Batch processing machines
Parallel machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关.png)
Gut
GutIF0
PREAI
分享收藏A hybrid genetic heuristic for scheduling parallel batch processing. machines with arbitrary job sizes用于调度并行批处理的混合遗传启发式方法。具有任意作业大小的机器
PREAI
分享收藏Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date分解启发式方法可最大程度地减少具有共同到期日的并行预烧炉的提前迟到
PREAI
分享收藏
查看更多内容