Work scheduling method

• US 5,053,970 A
• Filed: 09/15/1988
• Issued: 10/01/1991
• Est. Priority Date: 09/18/1987
• Status: Expired due to Term

• Current Assignee: Hitachi, Ltd., Hitachi Microcomputer Engineering Limited (Hitachi, Ltd.)
• Original Assignee: Hitachi, Ltd., Hitachi Microcomputer Engineering Limited (Hitachi, Ltd.)
• Inventors: Komori, Noriko, Hara, Keiichi, Kurihara, Kenzo, Akashi, Kichizo
• Primary Examiner(s): RUGGIERO, JOSEPH F
• Application Number:
  US07/244,740
• Time in Patent Office: 1,111 Days
• Field of Search: 364/513, 364/468, 364/401, 364/402, 364/403, 364/149-151, 364/300, 364/200 MS File, 364/900 MS File
• US Class Current: 700/104
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: Y10S 706/904 Manufacturing or machine, e.g. agricultural machinery, machine tool

Abstract

In a scheduling system, constraints changing based on situations and scheduling know-how are implemented according to the knowledge engineering method, whereas computations for the concrete, optimal allocation are conducted according to the mathematical programming method. As a result, there can be achieved a scheduling which can easily cope with changes in the scheduling know-how and constraints and which has a high maintainability and a high computation speed.

Claims

1. A scheduling method for making a work schedule for allocating a plurality of work to a plurality of resources in a system including a CPU and a first and second memory means, comprising the steps of:

first representing scheduling constraints and scheduling know-how in a form of knowledge representation by knowledge engineering to make said work schedule and storing said knowledge representation in said first memory means,

second representing a part of optimal allocation in a plurality of programs built-in by mathematical programming and storing said plurality of programs in said second memory means,

determining at least one program from said plurality of programs by use of said knowledge representation stored in said first memory means, and

repeating said determining step to obtain said work schedule.

2. The scheduling method for making a work schedule according to claim 1, said step of second representing a part of optimal allocation in a plurality of programs built-in with the mathematical programming includes steps of:

analyzing status of allocation representing proceedings of schedules, and

determining, in response to the result of said analyzing step, both a program to be used for allocation and a parameter indicating status of execution of said program.

3. The scheduling method for making a work schedule according to claim 1, said step of representing said scheduling constraints and said scheduling know-how in a form of said knowledge representation including the step of:

describing various kinds of allocation programs.

4. The scheduling method for making a work schedule according to claim 1, further comprising the step of:

allocating maintenance jobs for each of said resources in parallel with a process for said allocation.