A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Optimization Algorithm Simulation for Dual-Resource Constrained Job-Shop Scheduling
2018
International Journal of Simulation Modelling
This research aims to optimize the job-shop scheduling constrained by manpower and machine under complex manufacturing conditions. To this end, a branch population genetic algorithm was presented based on compressed time-window scheduling strategy, and optimized with elite evolution and fanshaped roulette operator. Specifically, the compressed time-window scheduling strategy was proposed to meet the two optimization targets: the maximum makespan and the total processing cost. Then, the elite
doi:10.2507/ijsimm17(1)co2
fatcat:eiji6tetsvh2davwrth4yoo5hm