| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To automatically plan an optimum work schedule suitable for an actual work pattern even in the case of a complicate process calculation exceeding the limit of a person in charge of schedule planning and leveling each day load as much as possible while keeping the available starting date and the delivery date of each order. <P>SOLUTION: In planning the schedule wherein there are multi-order O<SB>i</SB>(i=1-N<SB>0</SB>) and multi-process P<SB>j</SB>(j=1-N<SB>p</SB>), and a total processing time T(O<SB>i</SB>, P<SB>j</SB>) in each process P<SB>j</SB>of each order O<SB>i</SB>and the available starting date S(O<SB>i</SB>) and the delivery date D(O<SB>i</SB>) of each order O<SB>i</SB>are given, loads at every reference time unit of each process P<SB>j</SB>(sum of processing time of whole orders for its reference time unit) is leveled by making a processing time x(O<SB>i</SB>, P<SB>j</SB>, n) (n is a variable indicating a reference time unit) at every reference time unit to become a schedule unit in the process P<SB>j</SB>of each order to be variable. <P>COPYRIGHT: (C)2005,JPO&NCIPI</p> |
