No-wait on-line supply chain scheduling problems with transfer time

This paper considers on-line supply chain scheduling problems which is characterized by no-wait, transfer time between operations, processing time between two positive limits, etc. Manufacturer may receive orders from customers at any moment. There is no any information about the coming orders such as the orders quantity, release and processing time, etc. The paper gives an algorithm which can complete the orders within the time confined by available resources without changing other jobs' schedule. The simulation results show the effectiveness of the algorithm for solving large-scale order.