Flexible job-shop scheduling problem is an extension of the classical job-shop scheduling problem. Flexible job-shopscheduling problem allows an operation to be processed by several different machines. Flexible job-shop scheduling problemwith overlapping in operations means that an operation is divided into multiple sublots and each sub-lot is treated separately andtransferred to the next processing stage once it is completed. In previous research, a genetic algorithm is proposed to solve thisproblem. In this study, we try to improve the procedure of previous research to achieve better results. The proposedimprovements were tested on a set of benchmark problems and compared with the results obtained by previous research.
展开▼
