Study On Product Scheduling Problem With No-wait Constrains Between Operations

With high-new technology especially information technology developing rapidly, customer demand changing rapidly and the economic globalization, enterprises set up an urgent claim to enhance the improvement and innovation of technology and management. The core of production and operation management is that the production Job-Shop scheduling problems can get the optimal solution efficiently, and therefore the study of Job-Shop scheduling problem has important theoretical meaning and practical value.Based on analyzing the objective, type and the present research of Job-Shop scheduling, a method that operations with no-wait constraints are changed into a virtual operation is proposed by taking into account the practical problem of operations with no-wait constraints and together with ACPM(allied critical path method)and BFSM(best fit scheduling method) scheduling algorithm. The concepts of standard operations, virtual operations, the no-wait, expansion processing chart are proposed, the remove and adjust algorithm is designed. The operations with no-wait constraints are changed into a virtual operation by the way proposed, and change scheduling problem of no-wait operations into general scheduling problem with virtual operation, then virtual operations are processed respectively on corresponding machine with remove and adjust algorithm, the scheduling problem with no-wait constraints between operations is solved.Aiming at the scheduling problem of complex products with no-wait constraints between operations, the concepts of the expansion processing tree and complex product are proposed, the remove and exchange algorithm is designed, the virtual operations of complex products processed respectively on corresponding machine with remove and exchange algorithm, change scheduling problem of no-wait constraints between operations into general scheduling problem with virtual operation, the complex products scheduling problem of with no-wait constraints between operations is solved.Aiming at the no-wait constraints between operations dynamic scheduling problem, when the last product arrives, by the remained operations of product at the first should be judged with the operations of product last to construct a new expansion processing tree. The trees are scheduled according to remove and exchange algorithm proposed. The complex products dynamic scheduling problem of with no-wait constraints between operations is solved.