1. 考虑强制同机并行作业的广义作业车间调度优化.
- Author
-
金鸿, 张胡成, 信德全, and 吕盛坪
- Subjects
- *
PRODUCTION scheduling , *GENETIC algorithms , *INTEGER programming , *SEARCH algorithms , *PROBLEM solving - Abstract
The combination processing of molds and electronic product joint inspection introduce the mandatory concurrent operations on the same machine (MCDSM), which breaks the constraint that the same machine cannot process different jobs at the same time in the job shop scheduling (JSP) To solve this type of job shop scheduling problem, this paper proposed an adaptive hybrid initialization genetic algorithm (AHIGA). Firstly, this paper defined the problem as a generalized JSP considering mandatory concurrent operations on the same machine (GJSPMCO) problem, and established an optimization model using mixed integer programming with the objective of minimizing the maximum completion time. Next, it designed corresponding encoding and decoding techniques to support the representation and resolution of feasible scheduling plans within the constraints of MCOSM. Meanwhile, it established a population hybrid initialization method to generate high-quality feasible solutions. This paper also designed novel crossover and mutation operation methods to ensure the feasibility of newly generated solutions under the constraint of MCOSM. Additionally, it constructed an adaptive crossover and mutation operators to enable the adaptive updating of offspring, thereby enhancing the algorithms global search capability. Finally, it constructed 40 test cases based on JSP benchmark, and used these test cases and an example of joint inspection of electronic products for experiments. The results show that the proposed model and algorithm can effectively solve GJSPMCO problem, and the improvement strategies can enhance the quality of solutions, demonstrating the feasibility of the model and the superiority of AHIGA. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF