Abstract: In order to solve the integrated scheduling problem that there is difference at starting time and delivery dates of complex products of many species of small batches, an integrated scheduling algorithm based on delivery dates urgency degree is put forward. This algorithm schedules from font to back according to the beginning time of products. When there exist multi-products with the same beginning time, the scheduling order of these products is determined by the urgency degree of priority processing; if there exist products with the same time degree of urgency, they will be scheduled according to delivery date and priority schedules the products with early delivery date; if these products have the same delivery date they will be virtually combined to one product and be scheduled. The order of the scheduling products’ processes is determined by long-path strategy and short-time strategy; the processes’ start-times are determined by equipment compact operations. The algorithm combines the urgency of products and the advantages of equipment compact operations. Under the condition of reducing idle time of equipments, it not only can make the multi-products with different starting time be finished in delivery dates. Theoretical analysis and examples show that the algorithm can solve integrated scheduling problem with reasonable schemes in second complexity.

Key words: Integrated scheduling algorithm, Delivery dates, Difference at staring time, Equipment compact operations, Urgency degree