Job shop scheduling and production method and apparatus

• US 4,896,269 A
• Filed: 02/29/1988
• Issued: 01/23/1990
• Est. Priority Date: 02/29/1988
• Status: Expired due to Fees

• Current Assignee: General Electric Company
• Original Assignee: General Electric Company
• Inventors: Tong, David W.
• Primary Examiner(s): Ruggiero, Joseph
• Application Number:
  US07/161,513
• Time in Patent Office: 694 Days
• Field of Search: 364/468, 364/401, 364/402, 364/191-194, 364/300
• US Class Current: 700/101
• CPC Class Codes: G05B 19/41865 characterised by job scheduling, process planning, material flow
• CPC Class Codes: G05B 2219/34418 Scheduler for sequential control, task planning, control sequence
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Abstract

A method for the efficient scheduling of a first plurality of jobs and the performance of the jobs on a second plurality of processing machines uses various heuristic rules in order to meet scheduling objectives. Initially, each job is scheduled on the machines without regard to the scheduling of any other job. Job scheduling conflicts are then identified and a priority index for each conflict is computed. For each job step involved in the highest priority conflict, a flexibility index is computed. Based on the flexibility index, the highest priority conflict is resolved by relaxing one or more steps of one or more jobs. If the conflicts have not been resolved at this stage, control returns to the step of identification of all remaining job scheduling conflicts. Upon resolution of all conflicts, an overall schedule of all jobs on all machines may be displayed. Additionally, the jobs are then performed on the machines based upon the final, conflict free schedule.

Claims

1. A method for performing a first plurality of production jobs on a second plurality of machines, each said job comprising a sequence of job steps to be respectively performed in a predetermined sequence on said machines, each said job step having a predetermined performance duration, each said job having a total processing time that is the sum of the performance durations of its respective steps and a due time measured relative to an arbitrary schedule start time, said method comprising the steps of:

(a) initially scheduling each said job for performance on said machines without regard to the scheduling of any other ones of said jobs, the initial scheduling for each said job being the tightest possible schedule for that job;

(b) identifying all job scheduling conflicts, each said conflict being the scheduling of more than one said job step on the same machine at the same time;

(c) computing a priority index for each said conflict in accordance with the equation;

space="preserve" listing-type="equation">PI=PRP×

MDF×

PSL

where;

PI=conflict priority index;

PRP=product of the job process time/job due time ratios of the jobs in said conflict;

MDF=demand factor of the machine on which said conflict occurs;

PSL=sum of the performance durations of the job steps constituting said conflict;

(d) selecting a highest priority conflict having the largest computed priority index;

(e) computing, for each job step constituting said highest priority conflict, a flexibility index in accordance with the equation;

space="preserve" listing-type="equation">FI=ST-SF

where;

FI=job step flexibility index;

ST=job slack time;

SF=job shift factor;

(f) holding fixed in time in said schedule within said highest priority conflict the job step having the lowest computed flexibility index while relaxing in time each remaining job step in said highest priority conflict until that conflict is resolved;

(g) relaxing, for each said job a step of which was relaxed to resolve said highest priority conflict, the steps succeeding the relaxed step only to the extent necessary to assure the steps of said job remain in said predetermined sequence;

(h) returning to step (b) if there remain any scheduling conflicts;

(i) providing a final, conflict free schedule for the performance of said first plurality of jobs on said second plurality of machines; and

(j) performing said first plurality of production jobs on said second plurality of machines based on said final, conflict free schedule.

2. The method of claim 1 wherein in step (a) the initial scheduling of each said job can include jobs commencing after said start time.

3. The method of claim 1 wherein time on said job schedule is divided into equal time increments measured from said start time, the performance duration of each said job step being equal to the duration of said equal time increments within which it can be performed, so that each said job step is scheduled to commence at the beginning of one of said time increments and end at the end of one of said time increments.

4. The method of claim 1 wherein said performance duration of each said job step includes a machine set-up time.

5. A method of production using digital computing apparatus to prepare a job schedule for each of a first plurality of production jobs on a second plurality of machines, each said job comprising a sequence of job steps to be respectively performed in a predetermined sequence on said machines, each said job step having a predetermined performance duration, each said job having a total processing time that is the sum of the performance durations of its respective steps and a due time measured relative to an arbitrary schedule start time, said method comprising the steps of:

(a) inputting to said computing apparatus as data for each said job;

(i) the sequence of steps associated therewith;

(ii) the identity of the machine on which each said job step is to be performed;

(iii) the performance duration of each said job step; and

(iv) the due time

(b) operating said digital computing apparatus to perform the steps of;

initially scheduling each said job for performance on said machines without regard to the scheduling of any other ones of said jobs, the initial scheduling for each said job being the tightest possible schedule for that job;

identifying all job scheduling conflicts, each said conflict being the scheduling of more than one said job step on the same machine at the same time;

computing a priority index for each said conflict in accordance with the equation;

space="preserve" listing-type="equation">PI=PRP×

MDF×

PSL

where;

PI=conflict priority index;

PRP=product of the job process time/job due time ratios of the jobs in said conflict;

MDF=demand factor of the machine on which said conflict occurs;

PSL=sum of the performance durations of the job steps constituting said conflict;

selecting a highest priority conflict having the largest computed priority index;

computing, for each job step constituting said highest priority conflict, a flexibility index in accordance with the equation;

space="preserve" listing-type="equation">FI=ST-SF

where;

FI=job step flexibility index;

ST=job slack time;

SF=job shift factor;

holding fixed in time in said schedule within said highest priority conflict the job step having the lowest computed flexibility index while relaxing in time each remaining job step in said highest priority conflict until that conflict is resolved;

relaxing, for each said job a step of which was relaxed to resolve said highest priority conflict, the steps succeeding the relaxed step only to the extent necessary to assure the steps of said job remain in said predetermined sequence;

returning to the scheduling conflicts identifying step if there remain any scheduling conflicts; and

providing a representation of a final, conflict free schedule for the performance of said first plurality of jobs on said second plurality of machines; and

(c) performing said first plurality of production jobs on said second plurality of machines based on said final, conflict free schedule.

6. The method of claim 5 wherein in step (a) the data further includes a time at which each said job is to commence in the initial scheduling thereof.

7. The method of claim 5 wherein time on said job schedule is divided into equal time increments measured from said start time, the performance duration of each said job step being equal to the duration of said equal time increments within which it can be performed, so that each said job step is scheduled to commence at the beginning of one of said time increments and end at the end of one of said time increments.

8. The method of claim 5 wherein said performance duration of each said job step includes a machine set-up time.

9. Apparatus for performing a first plurality of production jobs on a second plurality of machines, each said job comprising a sequence of job steps to be respectively performed in a predetermined sequence on said machines, each said job step having a predetermined performance duration, each said job having a total processing time that is the sum of the performance durations of its respective steps and a due time measured relative to an arbitrary schedule start time, said apparatus comprising:

means for initially scheduling each said job for performance on said machines without regard to the scheduling of any other ones of said jobs, the initial scheduling for each said job being the tightest possible schedule for that job;

means for identifying all job scheduling conflicts, each said conflict being the scheduling of more than one said job step on the same machine at the same time;

means for computing a priority index for each said conflict in accordance with the equation;

space="preserve" listing-type="equation">PI=PRP×

MDF×

PSL

where;

PI=conflict priority index;

PRP=product of the job process time/job due time ratios of the jobs in said conflict;

MDF=demand factor of the machine on which said conflict occurs;

PSL=sum of the performance durations of the job steps constituting said conflict;

means for selecting a highest priority conflict having the largest computed priority index;

means for computing, for each job step constituting said highest priority conflict, a flexibility index in accordance with the equation;

space="preserve" listing-type="equation">FI=ST-SF

where;

FI=job step flexibility index;

ST=job slack time;

SF=job shift factor;

means for holding fixed in time in said schedule within said highest priority conflict the job step having the lowest computed flexibility index while relaxing in time each remaining job step in said highest priority conflict until that conflict is resolved;

means for relaxing, for each said job a step of which was relaxed to resolve said highest priority conflict, the steps succeeding the relaxed step only to the extent necessary to assure the steps of said job remain in said predetermined sequence;

means for continuing to resolve scheduling conflicts until all conflicts are resolved;

means for providing a representation of a final, conflict free schedule for the performance of said first plurality of jobs on said second plurality of machines; and

means for performing said first plurality of production jobs on said second plurality of machines based on said final, conflict free schedule.

10. The apparatus of claim 9 wherein the initial scheduling of each said job can include jobs commencing after said start time.

11. The apparatus of claim 9 wherein time on said job schedule is divided into equal time increments measured from said start time, the performance duration of each said job step being equal to the duration of said equal time increments within which it can be performed, so that each said job step is scheduled to commence at the beginning of one of said time increments and end at the end of one of said time increments.

12. The apparatus of claim 9 wherein said performance duration of each said job step includes a machine set-up time.

13. Apparatus for performing a first plurality of production jobs on a second plurality of machines, each said job comprising a sequence of job steps to be respectively performed in a predetermined sequence on said machines, each said job step having a predetermined performance duration, each said job having a total processing time that is the sum of the performance durations of its respective steps and a due time measured relative to an arbitrary schedule start time, said apparatus comprising:

programmed digital computing apparatus for performing the steps of;

(a) initially scheduling each said job for performance on said machines without regard to the scheduling of any other ones of said jobs, the initial scheduling for each said job being the tightest possible schedule for that job;

(b) identifying all job scheduling conflicts, each said conflict being the scheduling of more than one said job step on the same machine at the same time;

(c) computing a priority index for each said conflict in accordance with the equation;

space="preserve" listing-type="equation">PI=PRP×

MDF×

PSL

where;

PI=conflict priority index;

PRP=product of the job process time/job due time ratios of the jobs in said conflict;

MDF=demand factor of the machine on which said conflict occurs;

PSL=sum of the performance durations of the job steps constituting said conflict;

(d) selecting a highest priority conflict having the largest computed priority index;

(e) computing, for each job step constituting said highest priority conflict, a flexibility index in accordance with the equation;

space="preserve" listing-type="equation">FI=ST-SF

where;

FI=job step flexibility index;

ST=job slack time;

SF=job shift factor;

(f) holding fixed in time in said schedule within said highest priority conflict the job step having the lowest computed flexibility index while relaxing in time each remaining job step in said highest priority conflict until that conflict is resolved;

(g) relaxing, for each said job a step of which was relaxed to resolve said highest priority conflict, the steps succeeding the relaxed step only to the extent necessary to assure the steps of said job remain in said predetermined sequence;

(h) returning to step (b) if there remain any scheduling conflicts;

(i) providing a representation of a final, conflict free schedule for the performance of said first plurality of jobs on said second plurality of machine; and

means for performing said first plurality of production jobs on said second plurality of machines based on said final, conflict free schedule.

14. The apparatus of claim 13 wherein in programmed step (a) the initial scheduling of each said job can include jobs commencing after said start time.

15. The apparatus of claim 13 wherein time on said job schedule is divided into equal time increments measured from said start time, the performance duration of each said job step being equal to the duration of said equal time increments within which it can be performed, so that each said job step is scheduled to commence at the beginning of one of said time increments and end at the end of one of said time increments.

16. The apparatus of claim 13 wherein said performance duration of each said job step includes a machine set-up time.