Method and apparatus for transforming a resource planning data structure into a scheduling data structure

• US 5,765,139 A
• Filed: 04/30/1996
• Issued: 06/09/1998
• Est. Priority Date: 04/30/1996
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Bondy, Gregory Louis
• Primary Examiner(s): Teska, Kevin J.
• Assistant Examiner(s): KAZIMI, HANI M
• Application Number:
  US08/641,309
• Time in Patent Office: 770 Days
• Field of Search: 705/9, 705/8, 705/3
• US Class Current: 705/7.24
• 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/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

An apparatus and method for directing a computer system to transform a plurality of data in a planning data structure into a scheduling data structure. Each entry of the scheduling data structure has at least a start date, quantity, and duration. The method includes the steps of if the first data is a member of a cost group, setting the duration to 0 and the start date to a beginning of a month, if the first data is not a member of the cost group, determining if the first entry is new, if the first entry is new, retrieving a second data from the planning data structure, setting the quantity for the first entry in the scheduling data structure to the larger of the first data and the second data, if the first entry is at least as large as the second entry, setting the start date to a beginning of a month and the duration to approximately a month, if the first entry is smaller than the second entry, setting the start date to a date later than the beginning of the month and the duration to a value less than a month, and repeating the above steps for all the data.

Claims

1. A method for directing a computer system to transform a plurality of data in a planning data structure into a scheduling data structure, each entry of the scheduling data structure having at least a start date, quantity, and duration, comprising the steps of:

if the first data is a member of a cost group, setting the duration to 0 and the start date to a beginning of a month;

if the first data is not a member of the cost group, determining if the first entry is new;

if the first entry is new, retrieving a second data from the planning data structure;

setting the quantity for the first entry in the scheduling data structure to the larger of the first data and the second data;

if the first entry is at least as large as the second entry, setting the start date to a beginning of a month and the duration to approximately a month;

if the first entry is smaller than the second entry, setting the start date to a date later than the beginning of the month and the duration to a value less than a month; and

repeating the above steps for all data.