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.
Models, constructive heuristics, and benchmark instances for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect
Deep Reinforcement Learning for Flexible Job Shop Scheduling with Random Job Arrivals
Centre for Artificial Intelligence, Zurich University of Applied Sciences(人工智能中心,苏黎世应用科学大学);Inspire AG(Inspire公司);Automatic Control Laboratory, ETH Zurich(自动控制实验室,苏黎世联邦理工学院)
Scheduling and Routing in the Flexible Job Shop with Heterogeneous Transbots and Zoning: A Constraint Programming Approach
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology(佐治亚理工学院 H. 米尔顿·斯图尔特工业与系统工程学校);Department of Operations and Decision Systems, Université Laval(拉瓦尔大学运营与决策系统系)
Instance Configuration for Sustainable Job Shop Scheduling
Universitat Politècnica de València(巴塞罗那理工大学);valgrAI - Valencian Graduate School and Research Network of Artificial Intelligence(瓦伦西亚人工智能研究生学院和研究网络);Research Network of Artificial Intelligence(人工智能研究网络)
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems
Eindhoven University of Technology(埃因霍温理工大学);Eindhoven Artificial Intelligence Systems Institute(埃因霍温人工智能系统研究所);Delmia R&D, Dassault Systèmes(达索系统Delmia研发部)