arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.2253math.OCcs.NE
收藏

求解柔性作业车间调度问题的遗传算法

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

Sayedmohammadreza Vaghefinezhad, Kuan Yew Wong

摘要:

柔性作业车间调度作为一种有效的制造系统,已被注意到,以应付快速发展,在今天的竞争环境。柔性作业车间调度问题(FJSSP)是最优化领域中的一个NP难问题。考虑到现实世界的动态性,使得这个问题变得越来越复杂。FJSSP领域的大多数研究都只关注最小化总完工时间。本文建立了FJSSP的数学模型。目标函数是在满足一定约束条件下,使总利润最大化。随着时间的变化,原材料成本和销售价格以及每个时期的不同需求被认为是减少现实和模型之间的差距。一个生产气阀各种零件的制造商被用作案例研究。采用遗传算法(GA)解决了多部件、多周期、多工序的并行机调度问题。获得的最佳答案确定了属于每个零件的预定义操作的不同机器的经济生产量,以满足每个时期的客户需求。

英文摘要:

Flexible job shop scheduling has been noticed as an effective manufacturing system to cope with rapid development in today's competitive environment. Flexible job shop scheduling problem (FJSSP) is known as a NP-hard problem in the field of optimization. Considering the dynamic state of the real world makes this problem more and more complicated. Most studies in the field of FJSSP have only focused on minimizing the total makespan. In this paper, a mathematical model for FJSSP has been developed. The objective function is maximizing the total profit while meeting some constraints. Time-varying raw material costs and selling prices and dissimilar demands for each period, have been considered to decrease gaps between reality and the model. A manufacturer that produces various parts of gas valves has been used as a case study. Its scheduling problem for multi-part, multi-period, and multi-operation with parallel machines has been solved by using genetic algorithm (GA). The best obtained answer determines the economic amount of production by different machines that belong to predefined operations for each part to satisfy customer demand in each period.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑