期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：3
出版社：IJCSI Press
摘要：Flexible job shop scheduling has been noticed as an effective manufacturing system to cope with rapid development in todays competitive environment. Flexible job shop scheduling problem (FJSSP) is known as a NP-hard in the field of the optimization problem. Assuming the dynamic state of the real world, make these problems 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. Considering time-varying raw material and selling price and dissimilar demand for each period, are attempts that have been done to decrease gaps between reality and the model. A manufacturer that produces various parts of gas valves has been used as a case study. The scheduling problem for multi part, multi period, and multi operation with parallel machines has been solved by 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.
