This paper discusses a new approach of job shop production scheduling with the time limit of starting and completing work.In this approach,all operations in the queue are sorted according to their values of remaining operating time,and a preliminary feasible solution of production scheduling is achieved,which makes a shortest circulation time of parts in the system.Then adjustment is made aiming at maximum ahead/behind time span of operation block.The process is iterated until a satisfactory scheduling solution is obtained.Through analysis and application proof,the scheduling algorithm is suitable and feasible in engineering projects.
