Open AccessResearch on JOB SHOP Scheduling Problem
Author(s) -
Zi Yongsuo,
Caimeng Zhang,
Hong Yinsheng,
Qiu Pengrui,
Shu Wangjiao
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1607/1/012050
Subject(s) - job shop scheduling , mathematical optimization , flow shop scheduling , computer science , scheduling (production processes) , job shop , genetic algorithm , operations research , mathematics , schedule , operating system
Aiming at the dynamic job shop scheduling problem with extended process constraints, this paper constructs a mathematical model of job shop scheduling problem with the objective of minimizing the maximum completion time. Genetic algorithm is used to solve the minimum maximum completion time, and the results are compared with those obtained by WSPT, EDD, FCFS, LPT and Cr. Through computer simulation, it is verified that the minimum maximum completion time obtained by genetic algorithm is better than that by SPT, EDD, FCFS, LPT and Cr.