.png){kind=icon}
返回
Makespan minimization in flowshop batch processing problem with different batch compositions on machines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2017.09.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this research, we consider the flowshop batch processing problem (FBPP) with minimization of makespan, in which the composition of batches can change on different machines. A batch capacity of a machine restricts not only the maximum number of jobs, but also the total attribute size of jobs assigned to the batch processed on the machine. This is the first time that the FBPP is considered for different batch compositions on machines with respect to both the total size and the number of jobs assigned to batches. We propose a mixed-integer linear programming model for the research problem. Since this problem is shown to be NP-hard, several meta-heuristic algorithms based on particle swarm optimization (PSO), enhanced with local search structures, are proposed to solve the research problem heuristically. To have more diversity, different rules are implemented to generate the initial population of the PSO algorithms. Two lower bounding mechanisms are also proposed to generate good quality lower bounds for special cases of the research problem and, consequently, evaluate the performance of the proposed PSO algorithms. A data generation mechanism has been developed in a way that it fairly reflects the real industry requirements. The proposed PSO algorithms are examined by different numerical experiments and the results affirm the efficiency of the proposed algorithms.
Keyword:
Flowshop scheduling
Batch processing
Minimization of makespan
Particle swarm optimization
Mathematical modeling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
PREAI
分享收藏
A discrete version of particle swarm optimization for flowshop scheduling problems用于流水车间调度问题的粒子群优化算法的离散版本
PREAI
分享收藏
查看更多内容