Flexible Job Shop Scheduling based on Different Strategies and Algorithms
Flexible job shop scheduling (FJSS) is studied. Not only the operation scheduling problem is solved, but also the machine dispatch is optimized. The characteristic of FJSS is analyzed and accordingly the FJSS model is set up. The flexibility disposal is discussed and accordingly two kinds of scheduling strategies are put forward. The idea of algorithm hybrid is analyzed and accordingly immune simulated annealing algorithm is put forward. Several kinds of international FJSS Benchmark instances are simulated using different scheduling algorithms according to different scheduling strategies and their results are contrasted and analyzed. The simulation experiments indicate that the scheduling model, scheduling strategies and scheduling algorithms are fit for FJSS.
Flexible job shop scheduling scheduling strategy scheduling algorithm immune algorithm simulated annealing
Jianjun Yu Shouze Li
School of Business Administration South China University of Technology, Guangzhou
国际会议
香港·广州
英文
316-321
2010-07-25（万方平台首次上网日期，不代表论文的发表时间）