SCHEDULING METHOD

摘要

PROBLEM TO BE SOLVED: To shorten the execution time of schedule generation by making it easy to reflect information on postprocessing on preprocessing and relaxing the conditions of a computation end. SOLUTION: Modules 11 to 13 generate schedules unique to respective processes by using a computation expression for the operation start time of autonomous decentralized type scheduling algorithm and an equation (evaluation)=(evaluation index)+β.(sum of delays of operation end time of all jobs behind tentative latest end time)+(sum of advances of operation start time of all jobs ahead tentative start time) wherein the operation end time is incorporated as the evaluation index for scheduling of processes 1 to 3, and information for generating the schedules is exchanged among the modules.