A Three-stage Decoding Method for Just-In-Time Job-Shop Scheduling
Wang Sun-xin
Li Yan
Huai Wen-bo
Abstract：Some parts of large and complex products are very complicated in manufacturing since they have many operations to go through and are time-consuming .The just-in-time ( JIT ) scheduling is suitable to lean control these manufacturing process .In order to cope with the time consuming problem , the two-stage strategies were employed to solve JIT scheduling problem in most researches .A novel genetic algorithm ( GA) with three-stage decoding mechanism is introduced in this research .In each iteration process of GA, the chromosomes, which are represented by an operation-based scheme, are decoded successively by three stages.Firstly, the semi-active decoding method is induced to explore the more search space of solu-tions .Secondly , the greedy insertion for tardy operations is executed to swap the tardy operations left to the machine idle time to reduce the tardiness costs of solution .Thirdly, the greedy insertion for early opera-tions is proposed to swap the early operations rightly to the suitable machine idle time to cut the more earli-ness costs .The experimental results finally demonstrate the effectiveness and efficiency of our algorithm o-ver a wide range of benchmarks .
Keywords：job-shopjit schedulingearliness/tardinessgenetic algorithmthree-stage decoding
Publication Date：2015-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 98-104 )