.png){kind=icon}
返回
Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2022.105899.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the integrated scheduling problem of production and delivery on parallel batch processingmachines with non-identical capacities in different locations in cloud manufacturing. It is assumed that the jobshave arbitrary release times, different job sizes, unequal processing times, and unique information of customerssubmitting jobs. The service completion time of a job is the sum of the production completion time and thedelivery duration. The objective of the studied problem is to minimize the total service completion time. Amixed-integer programming (MIP) model is presented to solve this problem. Since the problem is NP-hard, anefficient heuristic algorithm and an improved particle swarm optimization algorithm are proposed. The twoproposed algorithms are compared with several state-of-the-art algorithms and the commercial optimizationsolver (Gurobi) through extensive experiments, verifying the effectiveness of the proposed algorithms.
Keyword:
Batch processing machines
Cloud manufacturing
Total service completion time
Particle swarm optimization
期刊
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
分享收藏Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times基于距离矩阵的启发式方法，可最大程度地减少具有任意作业大小和发布时间的并行批处理机器的制造时间
PREAI
分享收藏
查看更多内容