JIT-oriented Processing Path Schedule Over Internet-based Machining Resource Sharing System

摘要

JIT-oriented processing path schedule is a difficulty over Internet-based machining resource sharing system since which involves so much complex correlations. This paper solves the difficulty by three steps: Firstly, the mathematical model of JIT-oriented process schedule, considering the complex correlations and the earliness/tardiness penalty, is constructed; Secondly, the processing unit-based genetic algorithm is proposed and detailed; Thirdly, the original concept of processing order arrangement is proposed and its advantages are illustrated. Finally, a case study demonstrates the practicability and feasibility of the tactic combining processing unit-based GA and processing order arrangement.