Genetic Algorithm for Job Shop Scheduling with Earliness and Tardiness Penalties
The just-in-time production philosophy has led to a growing interest in scheduling problems considering both Earliness and Tardiness (E/T) penalties. An E/T schedule model, with the consideration of different penalties for tardiness, earliness and fiowtime of jobs, is introduced to minimize total production costs. Based on classical genetic algorithm, a new Enhanced Genetic Algorithm (EGA) is designed to solve tardy and early problems. In order to avoid infeasible decoding solutions and reduce simultaneously tardiness costs, the chromosome-repair operator based on critical paths is put forward to solve the problem that some jobs violate the due date constraints. The objective-value revision operator based on chromosome rescheduling is introduced to reduce in-process and final goods inventory costs by delaying job release date. The proposed approaches have been tested on a wide range of 80 scheduling problems and satisfactory results have been obtained.
Chromosome-repair Earliness and Tardiness Genetic algorithm Job shop scheduling Objective-value revision
Hong-an YANG Qi-feng SUN Jie GUO
Institute of System Integration & Engineering Management,Northwestern Polytechnical University,Xian,China Key Lab of Contemporary Design and Integrated Manufacturing Technology,MOE,Northwestern Polytechnical University,Xian,China
国际会议
厦门
英文
754-758
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）