Dual Resource Constrained Job Shop Scheduling Based on Compressed Time Window

To solve the double-objective Dual Resource Constrained Job-Shop Scheduling Problem with heterogeneous workers (DRCJSP-HW), a scheduling strategy based on compressed time window is proposed which compress and move up task time window to optimize global scheduling performance index at the expense of sacrificing scheduling performance of partial tasks. Against the limited ability of searching global optimum solution of Ant Colony algorithm and the slow convergence of genetic algorithm when solving double objective scheduling problem, the PBGA which inherit evolution experience of parent chromosome population with pheromone is designed. At last, simulation results demonstrate not only the satisfying optimization result of the scheduling strategy based on compressed time window but also the validity of the PBGA used for solving DRCJSP-HW.