Abstract
The four-dimensional scheduling algorithm is to select a sequence for job shop scheduling with the minimum evaluation indexes. Every operation has an evaluation index, which consists of four independent parameters. If process time and route obey normal distribution, the proof shows that there are about 88.75% averagely probability to attain the optimal makespan in the scheduling stage. This method is verified by cases with 100 jobs and 50 machines of large-scale operations, the optimization effect is 31%∼34% more than the general genetic algorithm and simulated annealing algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
