.png){kind=icon}
返回
Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2024.106708.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies a parallel heterogeneous machine batching and scheduling problem in which weighted jobs are first batched, and the batches are then assigned and sequenced on machines of varying capacities. The duration of a batch is the longest time needed to process a job, and the objective is that of minimizing the makespan, or the sum of the batches durations on the machine finishing last. The authors develop polynomialsize mathematical formulations and a variable neighborhood search metaheuristic. Extensive computational results suggest that a flow-based formulation outperforms a compact formulation, despite its larger number of variables. The metaheuristic is capable of producing high-quality solutions within a limited computing time.
Keyword:
Parallel machines
Batch processing machines
Makespan minimization
Variable neighborhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
A hybrid genetic heuristic for scheduling parallel batch processing. machines with arbitrary job sizes用于调度并行批处理的混合遗传启发式方法。具有任意作业大小的机器
PREAI
分享收藏分享收藏
查看更多内容