Dynamic scheduling

• US 5,212,791 A
• Filed: 07/27/1992
• Issued: 05/18/1993
• Est. Priority Date: 09/27/1989
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Damian, Richard G., Shah, Manesh J.
• Primary Examiner(s): Heckler, Thomas M.
• Assistant Examiner(s): KATBAB, ABDOLLAH
• Application Number:
  US07/920,000
• Time in Patent Office: 295 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 364/468, 395/904, 395/926
• US Class Current: 705/29
• CPC Class Codes: G05B 19/41865 characterised by job scheduling, process planning, material flow
• CPC Class Codes: G05B 2219/32252 Scheduling production, machining, job shop
• CPC Class Codes: G05B 2219/33002 Artificial intelligence AI, expert, knowledge, rule based system KBS
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/0875 Itemisation or classification of parts, supplies or services, e.g. bill of materials
• CPC Class Codes: Y02P 90/02 Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
• CPC Class Codes: Y02P 90/80 Management or planning
• CPC Class Codes: Y10S 706/904 Manufacturing or machine, e.g. agricultural machinery, machine tool
• CPC Class Codes: Y10S 706/912 Manufacturing or machine, e.g. agricultural machinery, machine tool
• CPC Class Codes: Y10S 706/919 Designing, planning, programming, CAD, CASE
• CPC Class Codes: Y10S 706/926 Time management

Abstract

The invention provides a new production scheduling system. The system includes a technique that utilizes a knowledge base system to dynamically schedule production of parts on a plurality of manufacturing machines. The schedule is updated dynamically to conserve synergism with the changing plant environment. The schedule is created to conform with predefined rules to conserve constraints imposed by the machinery to create parts of different specifications. The rules may be hard in that they may be specifiable in mathematical terms or they may be heuristic and soft in that they may be allowed to be relaxed as determined by operators who have learned from experience with the production machinery. Finally, the invention allows interactive monitoring and adjustment of the schedule by an operator including selective seeding of the schedule.

Claims

1. A method for operating a computer system to generate a schedule for a plurality of orders, the schedule having a plurality of slots for orders, the system having an inference engine for processing a set of rules including disposition, strategy and error detection rules, having a production memory for storing the set of rules and having working memory for storing a pool of schedules, comprising the steps of:

(a) forming a current parent schedule in the pool in the working memory having a first slot filled by an order by processing predetermined strategy rules using the inference engine;

(b) generating in the pool in the working memory all possible child schedules for the current parent schedule with each child schedule having at least one more slot filled than the current parent schedule by processing a rule using the inference engine;

(c) calculating error counts for the child schedules which violate the error detection rules by processing the error detection rules using the inference engine;

(d) deleting the current parent schedule from the pool in the working memory by processing a rule using the inference engine;

(e) deleting from the pool in the working memory the child schedules having error counts exceeding a predetermined error count threshold by processing the disposition rules using the inference engine;

(f) determining by processing a rule using the inference engine whether there are any schedules in the pool in the working memory and selecting, by processing a rule using the inference engine, a schedule in the pool, if any exists, as the current parent schedule while leaving the remaining schedules in the pool or ending if there are no schedules in the pool; and

(g) repeating steps (b) through (f) until a schedule with all slots filled is found which meets the disposition rules by processing a rule using the inference engine.

2. The method of claim 1 further comprising the steps of:

stopping the repetition of steps upon input from an operator;

modifying the current parent schedule in the working memory responsive to the operator input using a rule processed by the inference engine;

deleting all schedules from the pool in the working memory except the current parent schedule using a rule processed by the inference engine; and

resuming the method of claim 27 at the generating step.

3. The method of claim 1 further comprising the step of monitoring a value representing the elapsed time or iterations through a loop of steps, and responsive to the value exceeding a limit, altering the disposition rules by lowering the threshold of error counts to a second preselected value and returning previously deleted schedules having error counts less than the second preselected value back into the pool, thereby dynamically relaxing the rules so that an acceptable schedule may be found.

4. The method of claim 2 further comprising the step of monitoring a value representing the elapsed time or iterations through a loop of steps, and responsive to the value exceeding a limit, altering the disposition rules by lowering the threshold of error counts to a second preselected value and returning previously deleted schedules having error counts less than the second preselected value back into the pool, thereby dynamically relaxing the rules so that an acceptable schedule may be found.

5. The method of claim 4 wherein the orders are for units of steel.