The Improved Genetic Algorithm for the Compliex Job-shop Scheduling
Job shop scheduling problem is a typical NP-hard problem, most of the existing researches of job-shop scheduling have the following problems: firstly, took various processing parameters of the production systems as the exact uncertainty value; Secondly, took production system as a static system, ignored a variety of unexpected situations of the actual processing. This paper started from the actual demand of production operation and management of complex production environment, taking non-deterministic exact value, disturbance and other factors of the processing parameters in the production process into account, carried out the job-shop scheduling research question of a complex production environment based on improved genetic algorithm.
improved genetic algorithm complex production environment job shop scheduling
Yong CHEN Ting-ting HU Guo-xian WU Zhong-ming ZHAO
Institute of industrial Engineering,Zhejiang University of Technology,Hangzhou,China Hangzhou Technician College,Hangzhou,China Product Quality & Standard Institution under Ministry of Water Resource,Hangzhou,China
国际会议
厦门
英文
609-614
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）