US5233533A — Scheduling method and apparatus

Claim 1

Independent Claim 195 words

A method for scheduling a desired sequence of events which is to be accomplished by a certain date, comprising the steps of: for a given sequence of events each having a predeterminable length of time to accomplish and requiring predetermined amounts of resources, and for a given due date when all events in the given sequence must be accomplished, selecting one event at a time from the given sequence, in backward sequence order from a last event to a first event in the given sequence; for each successive selected event, serially scheduling a working length of time for that event, the working length of time being equal to the respective length of time to accomplish the event during a length of time in which the respective resources are available in the predetermined amounts; the serial scheduling of working lengths of time for each successive selected event including serially scheduling the working lengths of time from the given due date backward in time toward but excluding a present date; and rescheduling the working lengths of time for the sequence of events if the serial scheduling of working lengths of time requires inclusion of the present date.

Claim 2

Independent Claim 195 words

A method for scheduling a desired sequence of events which is to be accomplished by a certain date, comprising the steps of: for a given sequence of events each having a predeterminable length of time to accomplish and requiring predetermined amounts of resources, and for a given due date when all events in the given sequence must be accomplished, selecting one event at a time from the given sequence, in backward sequence order from a last event to a first event in the given sequence; for each successive selected event, serially scheduling a working length of time for that event, the working length of time being equal to the respective length of time to accomplish the event during a length of time in which the respective resources are available in the predetermined amounts; the serial scheduling of working lengths of time for each successive selected event including serially scheduling the working lengths of time from the given due date backward in time toward but excluding a present date; and rescheduling the working lengths of time for the sequence of events if the serial scheduling of working lengths of time requires inclusion of the present date.

Claim 3

Dependent Claim 48 words

A method as claimed in claim 1, wherein said rescheduling includes scheduling the working lengths of time of the sequenced events from a day after the present date into future dates in a forward sequence order from the first event in the given sequence to the last event.

Claim 4

Dependent Claim 95 words

A method as claimed in claim 1 wherein said rescheduling includes: a) determining an extra amount of time equal to a working amount of time from the present date backward in time to complete the sequence of events required by the serial scheduling, the working amount of time including the present date and past dates; b) modifying the given due date by the determined extra amount of time to define a new due date; and c) serially scheduling the working lengths of time from the new due date backward in time toward the present date.

Claim 5

Dependent Claim 68 words

A method as claimed in claim 1 wherein the step of serially scheduling an event includes: scheduling purchase of certain resources required for the event; and scheduling production of other resources required for the event, said scheduling of purchases and production of resources enabling respective resources to be available in the predetermined amounts during the length of time in which the respective working length of time is scheduled.

Claim 6

Dependent Claim 68 words

A method as claimed in claim 1 wherein the step of serially scheduling an event includes: determining availability of respective resources at particular times, including for certain resources stored in a predefined quantity, determining times when replenishment of the certain resources is required to maintain the predefined quantity but minimizes storage of quantities over the predefined quantity as a function of scheduled events which require the certain resources.

Claim 7

Dependent Claim 171 words

In a digital processor scheduling apparatus for scheduling a desired sequence of events which is to be accomplished by a certain date, the apparatus comprising: memory means coupled to the digital processor for storing a user specified due date and a corresponding sequence of events to be accomplished by the due date, each event being accomplishable in a predeterminable length of time and requiring predetermined amounts of resources; and a main computer routine performed by the digital processor for serially scheduling, from a last event to a first event in the stored sequence, working lengths of time which are equal to respective lengths of time of the events in the stored sequence, and which are times that the respective resources are available in the predetermined amounts, said serial scheduling beginning at the stored due date and proceeding backward in time toward but excluding the present date, said main computer routine further rescheduling working lengths of time for the sequence of events if the serial scheduling requires inclusion of a present date.

Claim 8

Dependent Claim 171 words

In a digital processor scheduling apparatus for scheduling a desired sequence of events which is to be accomplished by a certain date, the apparatus comprising: memory means coupled to the digital processor for storing a user specified due date and a corresponding sequence of events to be accomplished by the due date, each event being accomplishable in a predeterminable length of time and requiring predetermined amounts of resources; and a main computer routine performed by the digital processor for serially scheduling, from a last event to a first event in the stored sequence, working lengths of time which are equal to respective lengths of time of the events in the stored sequence, and which are times that the respective resources are available in the predetermined amounts, said serial scheduling beginning at the stored due date and proceeding backward in time toward but excluding the present date, said main computer routine further rescheduling working lengths of time for the sequence of events if the serial scheduling requires inclusion of a present date.

Claim 9

Dependent Claim 52 words

Scheduling apparatus as claimed in claim 6, wherein said main computer routine rescheduling includes scheduling the working lengths of time of the sequence of events from a day after the present date into future dates in a forward sequence order from the first event in the given sequence to the last event.

Claim 10

Dependent Claim 106 words

Scheduling apparatus as scheduled in claim 6, wherein the main computer routine reschedules working lengths of time for the sequence of events by a) determining an extra amount of time equal to amount of time between and including the present date and a last scheduled date of the serial scheduling when the serial scheduling backward from the stored due date requires inclusion of the present date; or; b) modifying the stored due date by the determined extra amount of time to define a new due date; and c) serially scheduling the working lengths of time from the new date backward in time toward the present date.

Claim 11

Dependent Claim 19 words

Scheduling apparatus as claimed in claim 6 wherein the resources required by the events include materials, machinery and personnel.

Claim 12

Dependent Claim 75 words

Scheduling apparatus as claimed in claim 9 further comprising a counting procedure performed by the digital processor in conjunction with the main computer routine, the counting procedure for summing predetermined amounts of material needed to accomplish the events of the stored sequence, and for providing from the summing an indication of total amount of material needed by a certain date according to the scheduling of the events of the stored sequence by the main routine.

Claim 13

Dependent Claim 33 words

Scheduling apparatus as claimed in claim 9 further comprising a procedure for minimizing waste of materials and machinery, the procedure being performed by the digital processor in conjunction with the main computer routine.

Claim 14

Dependent Claim 77 words

Scheduling apparatus as claimed in claim 9 wherein: materials are stored in respective predefined quantities; and for each event, the main computer routine schedules a respective working length of time for the event by determining availability of required materials at particular times and by determining times when replenishment of the materials is required to maintain the predefined quantities but minimizes storage of quantities over the predefined quantities as a function of scheduled events which require the materials.

Claim 15

Dependent Claim 73 words

Scheduling apparatus as claimed in claim 6 wherein for each event, the main computer routine schedules a respective working length of time for the event by recursively scheduling respective required resources including (i) scheduling purchase of certain resources required for the event, and (ii) scheduling production of other resources required for the event, the recursive scheduling enabling respective resources to be available in the predetermined amounts during the respective working length of time.

Claim 16

Dependent Claim 145 words

Scheduling apparatus as claimed in claim 6 for scheduling a sequence of processes to manufacture a desired item, the scheduling apparatus comprising: a first memory data for storing descriptions of resources for accomplishing various processes; and a process routing performed by the digital processor for determining which resources described in the first memory area to use and for determining a date and time schedule of use of the determined resources to manufacture the desired item, the process routine determining resources and the date and time schedule of use according to a plurality of pre-established rules for selecting resources, the plurality of pre-established rules minimizing waiting time and waste of resources by placing a higher priority on items having the earliest due date, and each of the pre-established rules having a preference for use on particular resources such that waste of the particular resources is minimized.

Claim 17

Dependent Claim 49 words

Scheduling apparatus as claimed in claim 14 wherein: the first memory area stored descriptions include descriptions of materials, workstations and staff; and the rules of the process routine for selecting resources further include rules for selecting materials and workstations and rules for routing selected materials among the selected workstations.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1996-08-02	1997-02-01	1997-08-03	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2000-08-02	2001-02-01	2001-08-03	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2004-08-02	2005-02-01	2005-08-03	$7700.00	Window Closed / Lapsed

Scheduling method and apparatus

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag