| With information technology developing rapidly, customer demand changing rapidly and the economic globalization, how to schedule huge resource well becomes an important problem to economy development. In reality, scheduling problem trend to be the aspect which has complex objects and complex constrains. Complex product scheduling problem is generated from this situation. So, research on complex product scheduling problem has important theoretical meaning and practical value.Complex product scheduling problem is the scheduling problem which has constrains between jobs. Compared to the traditional scheduling problem has no constrains between jobs, the scheduling objects are more complex and have more constrains. Complex product's tree model contains operations and assembles which expands the scheduling research area.Through studied the use of idle-time partitions in complex product's scheduling problem, a scheduling algorithm confirms the processing sequence of complex multi-product by calculating the cumulative length of idle-time partitions on the machine is proposed. The algorithm arranges complex product with shorter idle-time firstly by comparing the cumulative length of idle-time partitions which are produced after products are processed, made the scheduling result more compact to allied critical path method, improved the efficiency of equipments and short the whole scheduling idle-time.Because complex multi-product are scheduling by sequence, if determine the complex multi-product' scheduling sequence by only one time count the length of idle-time partitions on the machine, it doesn't consider the change of the scheduling environment, also doesn't consider the dynamic change of the total idle-time partitions. A new scheduling algorithm which calculates the total idle-time partitions dynamically is proposed. It shows that the algorithms this paper proposed not only be easy to realize but also can obtain better results through analyze and experiments. |
PDF Full Text Request