Source: https://patents.google.com/patent/US4852001A/en
Timestamp: 2018-10-21 05:27:07
Document Index: 498495716

Matched Legal Cases: ['art 101', 'art 102', 'art 103', 'art 104', 'art 105', 'art 102', 'art 102', 'art 102', 'art 102', 'art 103', 'art 104', 'art 104']

US4852001A - Job scheduling method and system - Google Patents
Job scheduling method and system Download PDF
US4852001A
US4852001A US07074767 US7476787A US4852001A US 4852001 A US4852001 A US 4852001A US 07074767 US07074767 US 07074767 US 7476787 A US7476787 A US 7476787A US 4852001 A US4852001 A US 4852001A
US07074767
Isao Tsushima
Tetsuo Kusuzaki
The present invention relates to a scheduling method for allocating a time and a job to each resource (person, installation), and more particularly to a job scheduling method suitable for a project which needs to consider a number of restrictions of the job allocation.
In order to complete a given project with limited resources (persons and installations), it is important to develop a schedule capable of allocating a suitable time and a suitable job to each resource. Without a proper schedule, jobs may concentrate on a particular resource or no job may be allocated to another particular resource thus leading to an inability to complete a workload per day.
Job scheduling has applications to various fields. One practical scheduling method is known described, for example, in "ACTIVITY NETWORK", by Elmagraphy, pp. 144 to 149, JOHN WILEY & SONS, March 1977. A brief description of a conventional system of this type will be given with reference to FIG. 2.
First, an earliest start time is allocated to each job (indicated by A to E in the Figure) to obtain an initial workload allocation result. In the example shown in FIG. 2, it is assumed that two persons are necessary for each job and the total number of persons is four. According to the initial workload allocation result, six persons are required at a peak workload, which means a shortage of two persons. With a conventional system, workload balancing has been carried out to balance the workload within a limited number of persons. Since a start time for each job is given an earliest start time at the initial workload allocation, there is a job or jobs which can be shifted to the right along the time axis, i.e., can be delayed. Therefore, a job (illustratively job F) which can be completed at the latest finish time is selected among the jobs and shifted to the right to the latest start time before the appointed time (time 20 in this example). Succeedingly, the similar procedure as above is repeated until the workload is balanced within the resource capacity.
The above conventional system, however, cannot be applied to various fields and is not suitable for the application to other than the manufacturing industry.
It is an object of the present invention to provide a job scheduling method having a wide range of applications, an excellent optimum status, a good processing efficiency and a high descriptive nature.
To achieve the above object, scheduling in various fields has been analyzed to definitely show problems arising if the above conventional system is applied to the fields other than the manufacturing industry. The problems have been solved in the manner as described in the following, taking a job scheduling in a super market as an example.
(1) An alternative resource can be used for each job. According to the present invention, although a register clerk for example should generally be a clerk, a part timer or temporary employee does the work if the register clerk is busy at another work. If not possible, a management person is impelled to do the work. According to the conventional system, each resource doing a job is defined only in a general sense.
(2) A latest start time can be given to a particular job. According to the present invention, a finish time of an order for example can be given a time as late the order due time as possible. According to the conventional system, all jobs are given earliest start times at the initial workload allocation. A finish time may be given an order due time, but it is a mere chance.
(3) As means for balancing a peak workload in excess of the resource capacity, not only start time delaying function but also start time hastening function, job cutting function and job relieving function are added. It is necessary for the order job described in the above (2) to be shifted to the left if a start time is given a latest start time at the workload allocation. Further, if there is a peak workload in excess of the resource capacity even after the shift of a start time, a job cutting of "a certain work is not done today" is effected in an actual job scheduling. Furthermore, even if the total workload does not exceed the capacity for all resources, a peak workload of a certain resource type may exceed its capacity if a resource type most suitable for each job at a time is allocated as described in the above (1). In this case, a job relieving function for relieving the job by another resource is effected to balance the peak workload.
(4) A priority order of jobs is considered in balancing the workload. There occurs a case where a job is not desired to be shifted even if it has a room for shift. There is also a job which is not desired to be cut or relieved as described in the above (3). For example, a shop clean-up work should be cut rather than a register work which is more directly related to customer services.
In view of the above, a job scheduling system according to this invention is provided with means for describing initial workload allocation, and knowledge and know-how for the workload allocation, in the form of rules.
According to the present invention, by means of the above-described rule description means, it is possible to realize a system having a wide application field, in which system it is easy to describe, add and modify various knowledge and know-how for the workload allocation and the like. Further, an improved optimum status and processing efficiency can be attained because of the inclusion of the fundamental workload balancing functions described in the above (3).
FIG. 1 is a functional block diagram showing an embodiment of a job scheduling system with various tables according to the present invention;
FIG. 2 is a schematic diagram illustrating a conventional system;
FIG. 3 is an initial workload allocation rule table;
FIG. 4 is a workload allocation rule table (for all resources);
FIG. 5 is a workload allocation rule table (for each resource type);
FIG. 6 is a capacity data table (for each resource type);
FIG. 7 is a capacity data table (for all resources);
FIG. 8 is a flow chart showing a processing by the initial workload allocation part;
FIG. 9 is a workload allocation result table (for each job);
FIG. 10 is a workload allocation result table (for each resource type);
FIG. 11 is a workload allocation result table (for all resources);
FIG. 12 is a flow chart showing a processing by the workload allocation part;
FIG. 13 is a flow chart showing a processing by the workload allocation part for all resources, which is a part of the flow chart of FIG. 12;
FIG. 14 is a flow chart showing the detail of the start time delaying and hastening functions by the workload balancing means for all resources;
FIG. 15 is a flow chart showing the detail of the job cutting function by the workload balancing means for all resource; and
FIG. 16 is a flow chart showing the detail of the job relieving function which is the workload balancing means for each resource type.
FIG. 1 is a functional block diagram showing an embodiment of a job scheduling system with various tables according to the present invention. The relationship between each block and table will be detailed later, as it becomes necessary, with reference to other figures.
A main control part 101 sequentially actuates and controls a data input part 102, an initial workload allocation part 103, a workload balancing part 104 and an output part 105, to thereby obtain a resultant output.
The input part 102 stores input data regarding rules and resource capacities in each table 106 to 113. The description for the tables will now be given hereinafter.
FIG. 3 shows the structure of an initial workload allocation rule table 106. As a descriptive format for initial workload allocation rules, there is provided a basic statement of "as an initial workload for job [P1 ], resource type [P2 ] and number of persons [P3 ] are allocated between [P4 ] o'clock to [P5 ] o'clock". P1 to P5 are given names and numerals for each job. The input part 102 stores the contents of a rule in the table 106 shown in FIG. 3, in accordance with the names and numeral values P1 to P5. Namely, the particular job name and resource type inputted as P1 and P2 are converted respectively into job number P1 ' and resource type number P2 ' by an editor in the computer for the purpose of simplicity of processing. The correspondence between them is decided when a rule is inputted. The inputted number of persons P3 is stored directly in the table. The particular inputted times P4 and P5 are converted respectively into a start time unit number P4 ' and an end time unit number P5 ' by the editor in the computer. This correspondence between them is also decided when the rule is inputted. With this initial workload allocation rule, it is possible to allocate most suitable time units to the workload of a job.
FIG. 4 shows the structure of a workload balancing rule table (for all resources) 107. As a descriptive format for workload balancing rules for all resources, there is provided a basic statement of "IF (workload exceeds the resource capacity), THEN (apply workload balancing means [P4 ] to job [P1 ] between [P2 ] o'clock and [P3 ] o'clock, with priority [P5 ])". The input part 102 stores the contents of a rule in the table 107 shown in FIG. 4, in accordance with the names and numeral values P1 to P5. One of the names, i.e., right-shift, left-shift and cut, of workload balancing means is designated. A priority order during application of a rule is designated as [P5 ].
The names and times inputted as P1 to P3 are converted by the editor in the computer into corresponding numbers P1 ' to P3 '.
FIG. 5 shows the structure of a workload balancing rule table (for each resource type) 108. As a descriptive format for workload balancing rules for each resource type, there is provided a basic statement of "IF (workload exceeds the resource type capacity), THEN (relieve job [P2 ] by resource type [P3 ], with priority [P4 ])". The input part 102 stores the contents of a rule in the table 108 shown in FIG. 5, in accordance with the names and numerical values P1 to P4.
The names P1 to P3 are converted by the editor in the computer into corresponding numbers P1 ' to P3 '.
FIG. 6 shows the structure of a capacity data table (for each resource type) 109. The table stores capacity data l (i, j) for each resource type number (i) and each time unit number (j). Based on the data, it is evaluated if the workload for each resource type is in excess of the resource type capacity.
FIG. 7 shows the structure of a capacity data table (for all resources) 110. The table stores capacity data (for all resources) l (j) for each time unit number ##EQU1##
Next, the initial workload allocation part 103 will be described. By this part, an initial workload allocation is performed. The processing flow is shown in FIG. 8. First, at step 801 a workload of each job is allocated along the time axis (i.e., in a workload allocation result table (for each job) 111, and in a workload allocation result table (for each resource type) 112) as an initial workload, in accordance with the information in the initial workload allocation rule table 106. Particularly, the following processing is conducted for each job: ##EQU2## wherein m(k, j) denotes an item in the workload allocation result table (for each job) 111 shown in FIG. 9, which item represents a workload of a job number k at a time unit number j, and wherein n(i, j) denotes an item in the workload allocation result table (for each resource type) 112 shown in FIG. 10, which item represents a workload for a resource type number i at a time unit number j.
Next, at step 802 an initial workload of resources per each time unit j is calculated in accordance with the information in the workload allocation result table (for each resource type) 112 shown in FIG. 10, and the results are stored in a workload allocation result table (for all resources) shown in FIG. 11. The processing is performed by ##EQU3## for j=1 to J, wherein n(j) denotes an item in the workload allocation result table (for all resources) 113 shown in FIG. 11, which item represents a workload for all resources at a time unit number j.
Next, the workload balancing part 104 will be described. In this part, a workload balancing is performed to balance a workload within the resource capacity if the workload is found in excess of the resource capacity at the initial workload allocation. It is necessary in this case that the workload for all resources be within the resource capacity. To this end, the basic workload allocation functions, i.e., start time delaying and hastening functions 114 and job cutting function 115 are first adopted. Thereafter, to make the workload of each resource type within the resource capacity, the job relieving function 116 is adopted. FIG. 12 is a flow chart illustrating such processing.
In the flow chart, first at step 1201 it is checked if the resource capacity is larger than the workloads of all resources and resource types. If the capacity is not larger than the workloads, the processing by the workload balancing part 104 stops. If the capacity is larger than the workloads, then the flow advances to the next step 1202. If the workload for all resources is not in excess of the capacity, step 1206 follows, whereas if affirmative at step 1202, step 1203 follows. At step 1203, it is checked if there is present any available workload balancing means for all resources (right-shift, left-shift or cut) in the workload balancing rule table (for all resources) 107 shown in FIG. 4. This judgement of availability is made in accordance with control flags in the table. The initial values of the control flags have been set such, that all means are available. If there is no means which indicates that a workload balancing is not possible, the processing stops. If there is any available means, the flow advances to step 1204 whereat means having a highest priority among available workload balancing means (rules) for all resources is selected to conduct a workload balancing.
If the workload for all resources becomes within the resource capacity by virtue of the workload balancing at step 1205, the flow advances to the next step 1206. If the capacity is larger than the workloads of all resource types at step 1206, then the processing stops. If not, the flow advances to step 1207 whereat it is checked if there is any available workload balancing means (relieving means) for each resource type in the workload balancing rule table (for each resource type). If not, the processing stops. If affirmative, step 1208 follows to select means having a highest priority order among available workload balancing means to conduct a workload balancing which is performed by the job relieving function 116 shown in FIG. 1. If the workloads become smaller than the capacity for all resource types by the workload balancing at step 1209, the processing stops.
Next, the detail of step 1204 of FIG. 12 will be given with reference to FIGS. 13 to 15.
As shown in FIG. 13, first at step 1301, means having a highest priority order among available means is derived by referring to the workload balancing rule table (for all resources) 107 shown in FIG. 4. The data P1 ' to P5 are substituted into q1 to q5. Using q5 storing a name of the workload balancing means, it is checked at step 1302 and 1303 if it represents a right-shift or a left-shift. In case of a right-shift or a left-shift, a workload balancing is performed to complete such processing. If it is neither a right-shift nor a left-shift, a workload balancing through a cutting function is performed to complete such processing.
Next, the detail of step 1304 will be given with reference to FIG. 14.
First at step 1401, a time unit number j* is derived whereat a job number q1 to be right- or left-shifted has a workload in excess of a predetermined number of persons (n(j)-l(j)>0). These data are collectively represented by a set {j*}. Next, at step 1402, j* of {j*} having a maximum n(j*)-l(j*) is derived and represented by j**. The reason for this derivation is that it is proper to balance a peak workload at first. Then at step 1403, it is checked if the workload balancing means is a right-shift. If affirmative, it is checked at step 1404 if J** is smaller than q3 (latest finish time unit number). If not smaller, it means that a right-shift is not available so that j** is removed from {j**} at step 1405. If smaller, it is checked at step 1406 if there is a time unit number which can be subjected to a right-shift. In other words, it is checked if there is j which suffices j**<j≦q3 and n(j)-l(j)<0. If not, the flow returns to step 1405. If affirmative, j having a minimum (or minimum workload) n(j)-1 (j) is derived and represented, at step 1407, by j*** which is a or right-shift of j**. To balance the workload one by one minutely, a workload in amount of one person of the job number q1 at the time unit number j** is shifted to the time number unit j***. Particularly, the contents of the workload allocation result table (for each job) 111 shown in FIG. 9, the workload allocation result table (for each resource type) 112 shown in FIG. 10 and the workload allocation result table (for all resources) 113 shown in FIG. 13 are changed as in the following:
m(q.sub.1, j**)←m(q.sub.1, j**)-1
m(q.sub.1, j***)←m(q.sub.1, j***)+1
n(i*, j**)←n(i*, j**)-1
n(i*, j***)←n(i*, j***)+1
n(j**)←n(j**)-1
n(j***)←n(j***)+1
In the above, i* is obtained, using q1 as a key, from the initial workload allocation rule table.
After completion of step 1408, the flow returns to step 1409 to which step 1405 is also returned. It is checked at step 1409 if there is a time unit number j* whose workload is shiftable. Namely, if the set {j*} is not an empty set (0), the above processess are repeated. If {j*}=0, selected workload balancing means is caused not applicable. Particularly, the control flag of workload balancing means in the workload balancing rule table (for all resources) 107 shown in FIG. 4 is changed from 0 to 1 at step 1410.
In case of a left-shift instead of a right-shift as described so far, steps 1411 and 1412 corresponding to steps 1412 and 1406, respectively, are executed. The description therefore is omitted due to a similar operation to the latter steps.
The above description has been directed to step 1304 of FIG. 13. Next, the detail of a workload balancing through a cutting operation at step 1305 will be given with reference to FIG. 15.
First at step 1501, a time unit number j* is derived whereat a job number q1 is in condition of n(j)-l(j)>0. These data are collectively represented by a set {j*}. Next, at step 1502, it is checked if the set {j*} is an empty set (0). If {j*} is not equal to 0, j* having a maximum n(j*)-l(j*) is derived and represented by j** at step 1503. A workload of the job number q1 at time unit number j** is cut by a persons. a is a minimum of {m(q1, j**), n(j**)-l(j**)}. The first term represents a workload which can be cut, whereas the second term represents an amount of excessive workload. Particularly, at step 1504 the contents of the workload allocation result tables are changed as in the following:
m(q.sub.1, j**)←m(q.sub.1, j**)-a
n(i*, j**)←n(i*, j**)-a
n(j**)←n(j**)-a
After completion of the cut operation for the time unit number j**, the j** is removed from the set {j*} at step 1505 to return to step 1502. If the set {j*} is not 0, the similar processes are repeated. If {j*}=0, the flow advances to step 1506 whereat selected workload balancing, i.e., cutting means is caused not applicable. Particularly, the control flag of workload balancing means in the workload balancing rule table (for all resources) is changed from 0 to 1.
Next, the detail of step 1208 shown in FIG. 12 will be given with reference to FIG. 16. First at step 1601, the time unit number j is set at 1. The control flags of the workload balancing rule table (for each resource type) 108 are all initialized to be applicable at step 1602. Next at step 1603, a resource type number i* is derived whose workload exceeds its capacity at a time unit number j (i.e., for i sufficing n(i, j)-l(i, j) >0). These data are collectively represented by a set {i*} which designates a resource type having an excessive workload and not subjected to a workload balancing. One of the resource types {i*} is selected and represented by i** at step 1604. The resource type number i** to be balanced is removed from the set {i*} at step 1605.
The resource type number i** is then subjected to a workload balancing. First at step 1606, a rule with P1 '-i**, control flag=0 (applicable) and a highest priority order is derived from the workload balancing rule table. The parameters P2 ' to P4 are substituted into q2 to q4, respectively. If a workload can be entered into a relief destination at step 1607 (i.e., n(q3, j)-l(q3, j)<0), and if there is a job number q2 to be relieved at the time unit number j at step 1608 (i.e., m(q2, j)≠0), then the relieving processing advances to step 1609. If one of the above two conditions is not met, the rule concerned cannot be used for the relieving operation so that the workload balancing rule is caused not applicable at step 1610. The flow returns to step 1606 to derive a next rule to be applied.
At step 1609 performing a workload balancing, a workload in amount of b persons of the resource type number i** at a time unit number j is moved to a resource type number q3, wherein
b=min{m(q.sub.2, j), l(q.sub.3, j)-n(q.sub.3, j), n(i**, j)-l(i**, j)}
Particularly, the workload allocation result table (for each workload type) 108 is changed as in the following:
n(i**, j)←l(i**, j)-b
n(q.sub.3, j)←n(q.sub.3, j)+b
If it is decided at step 1611 that the workload after the above relieving operation is not made within its capacity (i.e., if n(i**, j)-l(i**, j)>0), the flow returns to step 1610. If the workload of the resource type number i** is made within its capacity, it is checked at step 1612 if there is another resource type number not subjected to a workload balancing (i.e., {i*} =0?). If {i*} is not 0, the flow returns to step 1604. If {i*} is 0, it is checked at step 1613 if the workload balancing has been completed for all the time unit numbers (i.e., i=j?). If not (i<J), j+1 is substituted to j at step 1614. If i=J, the processing stops.
After the above workload balancing procedure, the output part shown in FIG. 1 outputs the contents of the workload allocation result table (for each job) 111, the workload allocation results table (for each resource type) 112 and the workload allocation result table (for all resources) 113. However, if the workload is decided not to be within the resource capacity, such a status is informed.
According to this embodiment, in contrast with the conventional system, the job can be allocated to any desired time at an initial workload allocation and in addition, left-shift, job cutting and relieving functions can be incorporated. Thus, a job scheduling having a variety of application fields can be realized. Further, a descriptive format of a rule with a definite statement is provided for expressing the know-how of the workload allocation and balancing, thus making it very easy to describe, add and modify the know-how. Furthermore, the system includes fundamental scheduling functions so that a suitable job scheduling can be realized in short time by merely changing the know-how.
According to the present invention, various conditions on the workload allocation and balancing can be taken into consideration. Thus, a suitable job scheduling can be realized for a variety of application fields to accordingly enable improved services and reduced manpower. Further, various conditions can be expressed in the form of rule so that the description, addition and modification of a rule are easy. Furthermore, the system includes fundamental scheduling functions so that even if the conditions to be considered are changed, the system can readily cope with such change.
1. A job scheduling method for scheduling of job allocation to various resources comprising the steps of:
inputting data associated with jobs and resources;
allocating a workload of each job to each time unit along a time axis in units of job;
allocating said workload to said each time unit in units of resource type;
calculating an initial workload for all resources at said each time unit, in accordance with said workload allocated in units of resource type;
performing a first workload balancing for a time unit whose initial workload for all resources exceeds a resource capacity, so as to make the workload at said time unit within said resource capacity;
after said first workload balancing, performing a second workload balancing so as to make the workload allocated in units of resource type within its resource capacity; and
outputting, as a job schedule, each workload at said each time unit obtained by said second workload balancing.
2. A job scheduling method according to claim 1, wherein said first workload balancing step includes a step of performing at least one of right-shift, left-shift and cutting processings for an excessive workload at said each time unit.
3. A job scheduling method according to claim 1, wherein said second workload balancing step includes a step of performing a relieving function for relieving a processing by one resource to another resource.
4. A job scheduling system for scheduling of job allocation to various resources comprising:
means for inputting data associated with jobs and resources;
means for allocating a workload of each job to each time unit along a time axis in units of job;
means for allocating said workload to said each time unit in units of resource type;
means for calculating an initial workload for all resources at said each time unit, in accordance with said workload allocated in units of resource type;
means for performing a first workload balancing for a time unit whose initial workload for all resources exceeds a resource capacity, so as to make the workload at said time unit within said resource capacity;
means for, after said first workload balancing, performing a second workload balancing so as to make the workload allocated in units of resource type within its resource capacity; and
means for outputting, as a job schedule, each workload at said each time unit obtained by said second workload balancing.
5. The job scheduling system according to claim 4, wherein said means for performing the first workload balancing includes at least one of right-shift, left-shift and cutting processing means for an excessive workload at said each time unit.
6. The job scheduling system according to claim 4, wherein said means for performing the second workload balancing includes relieving means for relieving a processing by one resource to another resource.
US07074767 1986-07-25 1987-07-17 Job scheduling method and system Expired - Lifetime US4852001A (en)
JP17364586A JP2533495B2 (en) 1986-07-25 1986-07-25 Wa - Kusukejiyu - ring method and apparatus
JP61-173645 1986-07-25
US4852001A true US4852001A (en) 1989-07-25
ID=15964452
US07074767 Expired - Lifetime US4852001A (en) 1986-07-25 1987-07-17 Job scheduling method and system
US (1) US4852001A (en)
JP (1) JP2533495B2 (en)
GB (1) GB8717088D0 (en)
US5155679A (en) * 1989-12-18 1992-10-13 Hewlett-Packard Company Set-up optimization for flexible manufacturing systems
WO1993005476A1 (en) * 1991-09-03 1993-03-18 Timephaser Corporation Method of constant rate of production scheduling
US5261099A (en) * 1989-08-24 1993-11-09 International Business Machines Corp. Synchronous communications scheduler allowing transient computing overloads using a request buffer
US5305221A (en) * 1990-05-04 1994-04-19 Atherton Robert W Real world modeling and control process for integrated manufacturing equipment
US5329456A (en) * 1991-08-09 1994-07-12 Mitsubishi Denki Kabushiki Kaisha Material flow control device
US5361362A (en) * 1989-02-24 1994-11-01 At&T Bell Laboratories Adaptive job scheduling for multiprocessing systems with master and slave processors executing tasks with opposite anticipated execution times respectively
US5440493A (en) * 1993-04-15 1995-08-08 Nec Corporation Lot transporting system between stations having different manufacturing equipment
US5671338A (en) * 1994-04-19 1997-09-23 Kabushiki Kaisha Toshiba Constraint evaluation system, expert system, and constraint evaluation method
US5787439A (en) * 1996-12-13 1998-07-28 Novell, Inc. Method and system for maintaining a preferred sequence for accessing a plurality of objects
US5838565A (en) * 1997-05-15 1998-11-17 Vanguard International Semiconductor Corporation Manufacturing control method for IC plant batch sequential machine
US6049774A (en) * 1996-07-08 2000-04-11 At&T Corp. Machine, method and medium for dynamic optimization for resource allocation
US6336101B1 (en) * 1998-09-24 2002-01-01 International Business Machines Corporation Tracking of computer components allocated during configuration of computer systems and networks by a simplified user friendly configuration process
US20030041087A1 (en) * 2000-03-31 2003-02-27 Dionisios Pothos Handling unscheduled tasks in a scheduling process
US20030050065A1 (en) * 2000-03-31 2003-03-13 Alletson Ian S Contingency planning in a scheduling process
US20040111307A1 (en) * 2002-12-04 2004-06-10 International Business Machines Corporation Electronic calendar management of privately owned resources
US20040194090A1 (en) * 2002-07-09 2004-09-30 International Business Machines Corporation Tracking customer defined workloads of a computing environment
US20040243457A1 (en) * 2003-05-28 2004-12-02 International Business Machines Corporation Project estimating system and method
US20050177273A1 (en) * 2002-03-27 2005-08-11 Ebara Corporation Material supply system in semiconductor device manufacturing plant
US20050267792A1 (en) * 2004-05-28 2005-12-01 Sumit Mehrotra Method and system for laboratory management
US20060143061A1 (en) * 2004-12-29 2006-06-29 Microsoft Corporation MultiPass scheduling system
US20060200657A1 (en) * 2005-03-02 2006-09-07 Funai Electric Co., Ltd. Network system, resources using device, and resources holding device
US20080082385A1 (en) * 2006-09-18 2008-04-03 Buschmar Consulting, Llc Project scheduling methods, systems, and apparatuses
US20090282411A1 (en) * 2008-05-08 2009-11-12 Francesco Maria Carteri Scheduling method and system
US20100070315A1 (en) * 2008-09-15 2010-03-18 Roberto Francisco-Yi Lu Methods and systems for optimizing production forecasts using statistically prioritized discrete modeling methodology
US20100249969A1 (en) * 2009-03-26 2010-09-30 Dell Products L.P. Work Content Variation Control System
US7827216B1 (en) 2003-07-23 2010-11-02 Novell, Inc. Method for coordinating relationships between multiple physical entities
US20110035042A1 (en) * 2009-08-06 2011-02-10 Nathan Henrichsen System And Method For Cascade Information Handling System Manufacture
US8428991B1 (en) 2005-06-30 2013-04-23 Dennis Brian Rooks System and method for scheduling
US20130312006A1 (en) * 2005-04-07 2013-11-21 Adaptive Computing Enterprises, Inc. System and method of managing job preemption
US8788308B1 (en) 2004-03-29 2014-07-22 West Corporation Employee scheduling and schedule modification method and apparatus
US9477519B2 (en) 2014-09-18 2016-10-25 Robert D. Pedersen Distributed activity control systems and methods
US20160364820A1 (en) * 2015-06-15 2016-12-15 Ncs Pearson, Inc. Load impact prediction processor
US9919648B1 (en) 2016-09-27 2018-03-20 Robert D. Pedersen Motor vehicle artificial intelligence expert system dangerous driving warning and control system and method
US9952932B2 (en) * 2015-11-02 2018-04-24 Chicago Mercantile Exchange Inc. Clustered fault tolerance systems and methods using load-based failover
EP0617372A1 (en) * 1993-03-25 1994-09-28 International Business Machines Corporation Apparatus for determing the optimal value of a control parameter and use of the apparatus
WO1999017194A1 (en) * 1997-10-01 1999-04-08 British Telecommunications Public Limited Company Resource management system
EP1246097A1 (en) 2001-03-29 2002-10-02 BRITISH TELECOMMUNICATIONS public limited company Work allocation system
GB0329046D0 (en) 2003-12-16 2004-01-14 Ibm Determining the impact of a component failure on one or more services
US8185422B2 (en) 2006-07-31 2012-05-22 Accenture Global Services Limited Work allocation model
US8306839B2 (en) 2009-08-28 2012-11-06 Accenture Global Services Limited Labor resource decision support system
US3648253A (en) * 1969-12-10 1972-03-07 Ibm Program scheduler for processing systems
GB1339090A (en) * 1971-06-09 1973-11-28 Ibm Data processing systems
GB1452865A (en) * 1973-11-21 1976-10-20 Ibm Data processing apparatus
US4183083A (en) * 1972-04-14 1980-01-08 Duquesne Systems, Inc. Method of operating a multiprogrammed computing system
Elmaghraby, Salah E., Activity Networks, John Wiley & Sons, Mar. 1977, pp. 144 149. *
Elmaghraby, Salah E., Activity Networks, John Wiley & Sons, Mar. 1977, pp. 144-149.
US6131093A (en) * 1992-03-04 2000-10-10 Fujitsu Limited Job scheduling system
US5727210A (en) * 1992-12-18 1998-03-10 International Business Machines Corporation Fault tolerant load management system and method
US7210119B2 (en) 2000-03-31 2007-04-24 @Road, Ltd. Handling unscheduled tasks in a scheduling process
US7305275B2 (en) * 2002-03-27 2007-12-04 Ebara Corporation Material supply system in semiconductor device manufacturing plant
US7346906B2 (en) 2002-07-09 2008-03-18 International Business Machines Corporation Workload management in a computing environment
US8484060B2 (en) 2003-05-28 2013-07-09 International Business Machines Corporation Project estimating system and method
US20110047194A1 (en) * 2003-07-23 2011-02-24 Novell, Inc. Method for coordinating relationships between multiple physical entities
US8452823B2 (en) 2003-07-23 2013-05-28 Novell, Inc. Method for coordinating relationships between multiple physical entities
US8869057B2 (en) 2007-01-29 2014-10-21 P&W Solutions Co., Ltd. Server displaying status of operator using seat layout, terminal for manager, system, and method
US8271982B2 (en) 2008-05-08 2012-09-18 International Business Machines Corporation Rescheduling jobs for execution by a computing system
US8164342B2 (en) 2009-08-06 2012-04-24 Dell Products L.P. System and method for cascade information handling system manufacture
US9996796B2 (en) 2014-09-18 2018-06-12 Robert D. Pedersen Distributed activity control systems and methods
JP2533495B2 (en) 1996-09-11 grant
GB2194086A (en) 1988-02-24 application
JPS6334056A (en) 1988-02-13 application
GB8717088D0 (en) 1987-08-26 grant
Maxwell et al. 1968 Multiple‐factor rules for sequencing with assembly constraints
Bause 1993 Queueing Petri Nets-A formalism for the combined qualitative and quantitative analysis of systems
US5839074A (en) 1998-11-17 Process of allocating frequencies to base stations of a mobile radiotelephone network
Efe 1982 Heuristic Models of Task Assignment Scheduling in Distributed Systems.
US5590323A (en) 1996-12-31 Optimal parallel processor architecture for real time multitasking
US6675190B1 (en) 2004-01-06 Method for cooperative multitasking in a communications network, and a network element for carrying out the method
Sakellariou et al. 2007 Scheduling workflows with budget constraints
US5615121A (en) 1997-03-25 System and method for scheduling service providers to perform customer service requests
Dobson et al. 1987 Batching to minimize flow times on one machine
Sarin et al. 1987 The machine loading and tool allocation problem in a flexible manufacturing system
Stecke 1983 Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems
Axsäter et al. 1984 Aggregation and disaggregation in hierarchical production planning
Talbot et al. 1978 An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems
Lee et al. 1994 Minimizing makespan in hybrid flowshops
Takine et al. 1997 A single server queue with service interruptions
US5630123A (en) 1997-05-13 Software system utilizing a filtered priority queue and method of operation
Fry et al. 1987 Minimizing weighted absolute deviation in single machine scheduling
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:TSUSHIMA, ISAO;KOMODA, NORIHISA;YAGI, MASAO;AND OTHERS;REEL/FRAME:004743/0564
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TSUSHIMA, ISAO;KOMODA, NORIHISA;YAGI, MASAO;AND OTHERS;REEL/FRAME:004743/0564