Research on agile job-shop scheduling problem based on genetic algorithm
A new genetic algorithm for solving the agile job shop scheduling is presented. The objective of this kind of job shop scheduling problem is minimizing the completion time of all the jobs, called the makespan, subject to the constraints. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also designed. It jumped from the local optimal solution, and the search area of solution is improved. Finally, the algorithm is tested on instances of 8 working procedure and 5 machines. The feasibility of GA is showed by simulation result
agile job shop scheduling genetic algorithm two-row chromosome structure working procedure machine distribution
Ye LI Da TANG Yan Chen
Transportation Management College, Dalian Maritime University, Dalian, China 116026 Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China 11602
国际会议
Second International Symposium on Electronic Commerce and Security(第二届电子商务与安全国际研究大会)(ISECS 2009)
南昌
英文
590-593
2009-05-22（万方平台首次上网日期，不代表论文的发表时间）