东华大学学报（英文版）2003，Vol.20Issue(3)：57-62,6.
Job-shop Scheduling with Multi-objectives Based on Genetic Algorithms
Job-shop Scheduling with Multi-objectives Based on Genetic Algorithms
摘要
Abstract
The technology of production planning and scheduling is one of the critical technologies that decide whether the automated manufacturing systems can get the expected economy. Job shop scheduling belongs to the special class of NP-hard problems. Most of the algorithms used to optimize this class of problems have an exponential time; that is, the computation time increases exponentially with problem size. In scheduling study, makespan is often considered as the main objective. In this paper, makespan, the due date request of the key jobs, the availability of the key machine, the average wait-time of the jobs, and the similarities between the jobs and so on are taken into accotmt based on the application of mechanical engineering. The job shop scheduling problem with multi-objectives is analyzed and studied by using genetic algorithms based on the mechanics of genetics and natural selection. In this research, the tactics of the coding and decoding and the design of the genetic operators, along with the description of the mathematic model of the multi-objective functions,are presented. Finally an illu-strative example is given to testify the validity of this algorithm.关键词
job shop scheduding/multi-objective optimization/genetic algorithmsKey words
job shop scheduding/multi-objective optimization/genetic algorithms分类
机械制造引用本文复制引用
周亚勤,李蓓智,陈革..Job-shop Scheduling with Multi-objectives Based on Genetic Algorithms[J].东华大学学报（英文版）,2003,20(3):57-62,6.基金项目
Supported by National Information Industry Department (01XK310020) and Shanghai Natural Science Foundation (No. 01ZF14004) （01XK310020）
