A New Boredom-aware Dual-resource Constrained Flexible Job Shop Scheduling Problem Using hybrid evolutionary algorithm

This is the experimental data of the manuscript entitled “A New Boredom-aware Dual-resource Constrained Flexible Job Shop Scheduling Problem Using hybrid evolutionary algorithm”. All data are generated through computer simulation and saved in the file with csv format. There include 18 instances used to verify the performance of proposed algorithm and model. The datasets show the number of jobs and corresponding operations, the type corresponding to each operation, and the number of machines and workers. The set of machines and workers available for each operation and the time required to process each operation on the available machines with standard efficiency also show in the datasets. The datasets also contain the types for operations that each worker can process, the switching time for each worker between two types of operations, and the initial efficiency of each worker in processing each type of operations. Moreover, motivation influence rate of workers, boredom influence rate of workers, and the three time nodes of efficiency conversions are also included.