JP2006106829A - Apparatus and program for production scheduling - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a production scheduling apparatus, etc. capable of efficiently allocating resources. <P>SOLUTION: The apparatus includes a PERT calculation means 52 for executing PERT calculation which calculates forward paths and backward paths with the respective number of resources ranging from the number of minimally required resources to the number of maximally required resources for each order in the process of an arbitrary number of resources; a loading processing means 53 for extracting the result of the PERT calculation calculated at the maximally required number of resources through the forward path for each order, and based on the extracted PERT calculation result for loading so as not to exceed the maximally required resources per unit time, and for calculating the number of mean required resources per unit time in a scheduling object period; and a load distribution processing means 34 for distributing the load so as not to exceed the mean requested resources in the past direction. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention equalizes the required number of resources per unit time in an arbitrary number of resources process in which work is performed with a predetermined number of resources between the minimum required resource count and the maximum required resource count to manufacture a product. The present invention relates to a production scheduling apparatus and a production scheduling program that calculate the optimal number of resources.

  In recent years, in the manufacture of products in factory line work or the like, the product items to be manufactured and the resources used for the product items are allocated by a computer. Here, “resources” include not only manufacturing equipment such as drilling machines and polishing machines but also workers. When an order (manufactured product order) is entered, the computer allocates the resource working time and the product item to be manufactured so that the ordered product can be delivered within the due date, and when and what to manufacture. decide.

  This resource allocation is performed for each time unit called an activity. For this activity, a time such as one hour or one day is preset according to the operating time of the manufacturing apparatus, the shift time of the worker, and the like. In resource allocation, this activity is associated with a resource such as a manufacturing apparatus or a worker, and a load that uses the resource is associated with the activity. Here, the load is a product item (or order) that uses the resource for this activity.

  At this time, for example, a worker or the like can easily change the number of resources arbitrarily according to the number of procurement personnel. However, in consideration of the employment situation of workers, it is preferable from the viewpoint of convenience in personnel allocation procedures to continuously procure the same number as possible. In addition, even in a manufacturing apparatus or the like, even when the number of resources can be arbitrarily changed, it is preferable to continuously procure as much as possible.

  Therefore, in the resource allocation, it is required to level the number of necessary resources by leveling the load in the activity.

  For example, there is a process load adjustment device that creates a practical payment plan even in other types of processes with many operational restrictions (see, for example, Patent Document 1). In the apparatus described in Patent Document 1, a pile is made for each process using the quantities stored in the process information memory and the product information memory, and the result is registered in the work allocation table. In the load collapse, the segment with the largest load is targeted for the collapse, and the segment moves the work of the corresponding product to the end of the work assignable engine. Repeat until the load of all segments in the work allocation table is less than the registered process capability.

In addition, there is a process plan creation support method that automatically creates a process plan that keeps the peak value of necessary resources as constant as possible in accordance with the time interval for batch procurement of resources (see, for example, Patent Document 2). In this patent document 2, a division period for dividing the entire period required for work into a plurality of parts is input, and the amount of resources is leveled with respect to the division period by arithmetic processing using work process data.
JP 2004-46308 A JP-A-8-255196

  However, in these Patent Documents 1, assuming that all products have been produced from the start of scheduling, the load is piled up, and the segment with the largest load is targeted for the landslide and the segments are considered in consideration of the delivery time margin. Move. In the method described in Patent Document 1, the starting points of the piles are all the same, and when moving a segment, it is moved in the future direction. In this case, there may be a case where the delivery date cannot be observed.

  Moreover, in the method described in Patent Document 2, it is possible to level the load for one order, but it is not possible to level the load for a plurality of orders.

  In view of such a situation, there is a demand for a method for efficiently allocating resources by, for example, leveling loads in activities for a plurality of orders.

  The objective of this invention is providing the production scheduling apparatus and production scheduling program which can allocate a resource efficiently.

In order to solve the above-mentioned problem, a first feature of the present invention is that an arbitrary resource whose work is executed with a predetermined number of resources between the minimum number of required resources and the maximum number of required resources to manufacture a product item. The present invention relates to a production scheduling apparatus that equalizes the number of necessary resources per unit time and calculates an optimum number of resources in several processes. That is, the production scheduling apparatus according to the first feature of the present invention includes order information including a product item, a production quantity, a start date and a delivery date, a resource name used in an arbitrary resource number process for producing the product item, a minimum Storage means for storing work process information associated with the required resource count, maximum required resource count, and work efficiency based on unit time, and order information and work process information are read from the storage means, and are subject to scheduling. The order information of the order and the work process information associated with the product item included in the order information are extracted and stored in the storage means as schedule data, the schedule data is read from the storage means, and the order is read out. Each resource number between the minimum required resource number and the maximum required resource number in the arbitrary resource number process for each Execute PERT calculation to calculate the forward path and backward path, and for each order, in the arbitrary resource count process, the minimum required number of resources to protect the delivery date, the number of days required for the minimum required resource count, the maximum required number of resources to protect the delivery date and the maximum PERT calculation means for calculating the number of days required, the earliest start possible date, the latest start possible date, and the latest completion date, and storing them in the storage means as PERT calculation results, and reading the PERT calculation results from the storage means For each order, the PERT calculation result calculated with the maximum required number of resources is extracted in the backward path, and the load pile is performed so that the maximum required number of resources is not exceeded per unit time based on the extracted PERT calculation result. The result is stored in the storage means as the load pile result, and the average per unit time in the period to be scheduled Calculate the required number of resources and store the load pile processing result in the storage means as the load pile result, read the PERT calculation result and the load pile result from the storage means, and read the PERT calculation result in the minimum necessary resource number and the maximum necessary resource for each order. Load hill-climbing processing means for performing load hill-climbing so as not to exceed the average required number of resources in the past direction based on the number, and storing the load hill-climbing result in the storage means.
Here, the “storage means” is a storage device such as a hard disk, a RAM, or the like.

  According to the present invention as described above, the load pile is first performed under the most severe postponement conditions, and the load collapse is performed in the past direction so as not to exceed the average required number of resources. Numbers can be leveled.

  The second feature of the present invention is that, in order to produce a product item in a computer, in an arbitrary resource number process in which an operation is performed with a predetermined number of resources between the minimum required resource number and the maximum required resource number. The present invention relates to a production scheduling program that equalizes the number of necessary resources every hour and calculates the optimum number of resources. That is, the production scheduling program according to the second feature of the present invention is used in the ordering information including the product item, the production quantity, the startable date and the delivery date from the storage means, and the arbitrary resource number process for producing the product item. Reads work process information associated with work efficiency based on resource name, minimum required resource number, maximum required resource number, and unit time, order information in which the order to be scheduled is stored, and included in this order information The work process information associated with the product item is extracted and stored in the storage means as schedule data, and the schedule data fetching means is read out, and the schedule data is read out from the storage means. Forward path and backward with each resource number between 1 and the maximum required resource number For each order, the minimum required number of resources that can meet the delivery date, the number of days required for the minimum required number of resources, the maximum number of required resources that can meet the delivery date, and The PERT calculation means for calculating the margin days in the maximum required number of resources, the earliest start possible date, the latest start possible date and the latest completion date and storing them in the storage means as the PERT calculation results, and the PERT calculation results from the storage means Read and extract the PERT calculation result calculated with the maximum required number of resources in the backward path for each order, and based on the extracted PERT calculation result, calculate the load pile so as not to exceed the maximum required number of resources per unit time And store it in the storage means as the load pile result, and the average number of required resources per unit time in the period to be scheduled And the load pile processing means for storing the load pile result in the storage means, the PERT calculation result and the load pile result are read from the storage means, and the minimum required resource number and the maximum required resource number for each order in the PERT calculation result are read. Based on this, load collapse is performed so as not to exceed the average number of required resources in the past direction, and the computer executes load load collapse processing means for storing the load collapse result in the storage means.

  ADVANTAGE OF THE INVENTION According to this invention, the production scheduling apparatus and production scheduling program which can allocate a resource efficiently can be provided.

  Next, embodiments of the present invention will be described with reference to the drawings. In the following description of the drawings, the same or similar parts are denoted by the same or similar reference numerals.

(Best Embodiment)
As shown in FIG. 1, the production scheduling apparatus 1 according to the preferred embodiment of the present invention is realized by executing a predetermined software program on a computer having a central processing control apparatus 101 and a storage apparatus 107. The The production scheduling apparatus 1 according to the preferred embodiment of the present invention is an arbitrary resource number in which work is executed with a predetermined resource number between the minimum necessary resource number and the maximum required resource number in order to manufacture a product item. In the process, the number of necessary resources is leveled for each activity (unit time), and the optimum number of resources is calculated. In the best mode of the present invention, one activity is described as one day. Here, in the best embodiment of the present invention, the arbitrary resource number step is a step in which the number of resources such as workers can be arbitrarily determined in a work process flow for manufacturing a predetermined product. For example, a process in which one or three people can work is called an arbitrary resource number process. In this arbitrary resource number process, the number of days required for manufacturing a product differs depending on whether the work is performed by one person or three persons. In the best mode of the present invention, for example, in a build-to-order manufacturing method for producing a product in response to an order (order) from a customer, a resource for producing a product item based on order information input from the customer Assign. In the order information, for example, a customer name, a product item to be ordered, a quantity, a delivery date, and the like are associated with an order identifier numbered in an order from a customer. In the preferred embodiment of the present invention, a production scheduling apparatus 1 capable of leveling the number of resources in an arbitrary number of resources process while keeping a delivery date especially for a plurality of orders will be described.

(Hardware configuration diagram of production scheduling device)
As shown in FIG. 2, the production scheduling apparatus 1 according to the preferred embodiment of the present invention includes a central processing control device 101, a ROM (Read Only Memory) 102, a RAM (Random Access Memory) 103, and an input / output interface 109. Are connected via a bus 110. An input device 104, a display device 105, a communication control device 106, a storage device 107, and a removable disk 108 are connected to the input / output interface 109.

  The central processing control device 101 reads and executes a boot program for starting the production scheduling device 1 from the ROM 102 based on an input signal from the input device 104, and further reads an operating system stored in the storage device 107. Further, the central processing control device 101 controls various devices based on input signals from the input device 104, the communication control device 106, etc., and reads programs and data stored in the RAM 103, the storage device 107, etc., into the RAM 103. A processing device that loads and implements a series of processing described later, such as data calculation or processing, based on a program command read from the RAM 103.

  The input device 104 includes input devices such as a keyboard and a mouse through which an operator inputs various operations. The input device 104 generates an input signal based on the operation of the operator, and inputs via the input / output interface 109 and the bus 110. It is transmitted to the central processing control apparatus 101. The display device 105 is a CRT (Cathode Ray Tube) display, a liquid crystal display, or the like, and receives an output signal to be displayed on the display device 105 from the central processing control device 101 via the bus 110 and the input / output interface 109. It is a device that displays the processing result of the control device 101 and the like. The communication control device 106 is a device such as a LAN card or a modem, and is a device that connects the production scheduling device 1 to a communication network such as the Internet or a LAN. Data transmitted / received to / from the communication network via the communication control device 106 is transmitted / received to / from the central processing control device 101 via the input / output interface and the bus 110 as an input signal or an output signal.

  The storage device 107 is a semiconductor storage device or a magnetic disk device, and stores programs and data executed by the central processing control device 101. The removable disk 108 is an optical disk or a flexible disk, and signals read / written by the disk drive are transmitted / received to / from the central processing control apparatus 101 via the input / output interface 109 and the bus 110.

  The storage device 107 of the production scheduling apparatus 1 according to the preferred embodiment of the present invention includes an order information storage unit 21, a work process flow information storage unit 22, a work process information storage unit 23, a resource group information storage unit 24, a resource An information storage unit 25, a schedule data storage unit 31, a PERT calculation result storage unit 32, a load pile result storage unit 33, a load landslide result storage unit 34, a resource-specific schedule result storage unit 41, and an order-specific schedule result storage unit 42 are stored. In addition, a production scheduling program is stored. When this production scheduling program is read and executed by the central processing control device 101 of the production scheduling device 1, the schedule data fetching means 51, PERT calculation means 52, load pile processing means 53, load load collapse as shown in FIG. A processing unit 54 and a schedule result output unit 55 are mounted on the production scheduling apparatus 1.

  1 and 2, the production scheduling apparatus 1 according to the preferred embodiment of the present invention has been described. However, it is not necessary to be mounted on one piece of hardware. For example, the order information storage unit 21, work process flow information storage unit 22, work process information storage unit 23, resource group information storage unit 24, and resource information storage unit 25 are stored in the storage device 107 built in the production scheduling apparatus 1. For example, it may be stored in a storage device mounted on different hardware such as a production management system and read to the production scheduling device 1 via a communication control device or the like. Each data stored in the storage device 107 may be stored in a storage device such as the RAM 103. Specifically, temporary data output by each means realized in the central processing control device 101 such as the schedule data storage unit 31, the PERT calculation result storage unit 32, the load pile result storage unit 33, and the load hill collapse result storage unit 34. The file may be stored in the RAM 103.

(Outline of production scheduling equipment)
Next, an outline of the production scheduling apparatus 1 according to the preferred embodiment of the present invention will be described with reference to FIG. 1 and FIG.

  First, in step S101, the schedule data fetching means 51 performs a process for creating schedule data. Here, an order to be scheduled is extracted from the order information storage unit 21 and the like, and work process flow information, work process information, resource group information, resource information, etc. relating to the product items included in the order are extracted, and a schedule data storage unit 31. When it is confirmed in step S102 that all schedule data has been read, the process proceeds to step S103.

  In step S103, PERT (Program Evaluation and Review Technique) calculating means 52 calculates a forward path and a backward path with each resource number between the minimum required resource number and the maximum required resource number in an arbitrary resource number process for each order. For each order, the minimum required number of resources that can meet the delivery date, the number of days required for the minimum required number of resources, the maximum required number of resources that can meet the delivery date, and the maximum required resource The marginal number of days, the earliest start possible date, the earliest completion date, the latest start possible date, the latest completion date, and the like are calculated and stored in the PERT calculation result storage unit 32. If it is confirmed in step S104 that PERT calculation has been performed for all orders, the process proceeds to step S105.

  Here, PERT calculation is a method of performing schedule management and process management for each activity in a production plan for producing a product through a plurality of manufacturing processes, for example. In PERT calculation, for example, when one activity is set to one day, each manufacturing process for manufacturing a product in the production plan based on a predetermined start date and completion date (delivery date) for a predetermined production plan. Determine the process plan such as start date and completion date. At this time, the process plan determined by calculating back the completion date of each manufacturing process based on the completion date is called a backward pass, and it is not allowed to be late to strictly observe the completion date of the production plan. This is the latest process plan. On the other hand, the process plan obtained by calculating the start date of each manufacturing process on the basis of the start date is called a forward pass, and is the earliest process plan that is not allowed to manufacture any earlier. In addition, when the start date of the first manufacturing process in the backward pass is the same as the start date determined in advance in the production plan, or the completion date of the final manufacturing process in the forward pass is the completion date determined in advance in the production plan The process plan is called a critical path, indicating that there are no spare days. In the preferred embodiment of the present invention, in the arbitrary resource number process, since the number of activities required for the process differs depending on the number of resources, PERT calculation is performed for each of the arbitrary resource numbers.

  In step S105, the load pile processing means 53 reads the PERT calculation result storage unit 32 from the storage device 107, and extracts and extracts the PERT calculation result calculated with the maximum required number of resources in the backward path for each order. Based on the PERT calculation result, a load pile is calculated for each activity so as not to exceed the maximum necessary resource number, and is stored in the load pile result storage unit 33, and an average necessary resource number per activity during the period to be scheduled is calculated. And stored in the load pile result storage unit 33. When it is confirmed in step S106 that load pile processing has been performed for all orders, the process proceeds to step S107.

  In step S107, the load collapse processing unit 54 reads the PERT calculation result storage unit 32 and the load pile result storage unit 33 from the storage device 107, and based on the minimum required resource number and the maximum required resource number for each order in the PERT calculation result. Then, load collapse is performed so as not to exceed the average required number of resources in the past direction, and the result is stored in the load collapse result storage unit 34. If it is confirmed in step S108 that the load leveling process has been performed for all orders, the process proceeds to step S109.

  In step S109, the schedule result output means 55 reads the load devastating result storage unit 34 from the storage device 107, associates the order assigned to the resource for each resource and for each activity, and stores it in the resource-specific schedule result storage unit 41. The resource allocated for each order is associated with the delivery schedule and stored in the order-specific schedule result storage unit 42.

  As described above, the production scheduling apparatus 1 according to the best embodiment of the present invention calculates the backward path and the forward path for each order in advance and can start the earliest possible start date and the latest start possible date. Calculate the date and latest completion date.

  Next, load piles are executed under the strictest postponement conditions to keep the delivery date, and the average required number of resources is calculated. Further, based on the information calculated by PERT calculation, load collapse is performed in the past direction so as not to exceed the average required number of resources.

  As a result, the production scheduling apparatus 1 according to the best embodiment of the present invention first performs load accumulation under the most severe postponement conditions, and performs load collapse in the past direction so as not to exceed the average required number of resources. The number of resources can be leveled within the average required number of resources while complying with the delivery date.

(Detailed explanation of production scheduling equipment)
Next, with reference to FIG. 1, each data and each means of the production scheduling apparatus 1 which concerns on the best embodiment of this invention are explained in full detail.

  As shown in FIG. 4, the order information storage unit 21 stores the ordered product item, production quantity, available start date, delivery date, and the like in association with each other. The order information storage unit 21 may describe only the product item and the production quantity that are the targets of the production plan based on the order input from the customer. Here, the available start date is determined in the production management system that handles all information related to the manufacture of the product, depending on the date of procurement of the parts to be manufactured and the date of delivery of the resources, and is related to the best mode of the present invention. It is a day when resources can be allocated by the production scheduling device. The delivery date is a delivery date considering the delivery lead time of the product to the customer, and is the delivery date targeted by the production scheduling apparatus according to the best mode of the present invention.

  As shown in FIG. 5, the work process flow information storage unit 22 associates the processes necessary for manufacturing the product item in order for each product item.

  As shown in FIG. 6, the work process information storage unit 23 stores the name of the resource used, the number of resources (eg, the number of machines, the number of personnel) for each product item and each process necessary for manufacturing the product item, The work efficiency per predetermined time is associated and stored. This work efficiency is preferably represented by the number of work per activity. Here, a process in which the number of resources is set to “1 to 5 people” as in the “packaging process” is defined as an arbitrary resource number process in the best embodiment of the present invention. Here, “1 person”, which is the minimum number of resources, is the minimum required resource number, and “5 persons” is the maximum required resource number. In this arbitrary resource number process, the activity required for this process differs depending on the number of resources. Specifically, in the example shown in FIG. 6, the work efficiency is “200 pieces / person day”. If 1000 products are manufactured under these conditions, it is possible to work with 1 packaging person and 200 pieces per activity (1 day), so if one packaging person is used, this packaging process takes 5 days. However, if the number of packaging personnel is five, this packaging process takes one day. In such an arbitrary resource number process, it is possible to specify an arbitrary number of resources in consideration of delivery date and other resources.

  As shown in FIG. 7, the resource group information storage unit 24 associates the number of resources that can be used for each process with the resource name.

  As shown in FIG. 8, the resource information storage unit 25 stores the schedule for each resource name and each activity. In the example shown in FIG. 8, the operating status (attendance status) of the packaging personnel is associated with each packaging personnel every day. On days when packaging personnel do not work, there is a constraint that orders cannot be assigned.

  The schedule data fetching means 51 reads the order information storage unit 21, work process flow information storage unit 22, work process information storage unit 23, resource group information storage unit 24, resource information storage unit 25, etc. from the storage device 107, The order information of the order to be scheduled and the work process flow information, work process information, resource group information, resource information, etc. associated with the product item included in the order information are extracted and stored in the schedule data storage unit 31. To do. Information such as the order information storage unit 21, work process flow information storage unit 22, work process information storage unit 23, resource group information storage unit 24, resource information storage unit 25, etc. is sent from an upper system such as a production management system via an interface. Or information may be set from input means of a terminal such as an administrator terminal. These pieces of information are stored in the storage device 107 from the outside, data related to the order to be scheduled is extracted, all of the data is taken into the memory such as the storage device 107 as the schedule data storage unit 31, and all this processing is performed. Holds until finished. The schedule data storage unit 31 may be provided in the RAM 103.

  The PERT calculation means 52 reads the schedule data storage unit 31 from the storage device 107, and performs a forward path and a backward path with each resource number between the minimum required resource number and the maximum required resource number in an arbitrary resource number process for each order. Execute the PERT calculation to calculate the minimum required number of resources that can meet the delivery date, the number of days required for the minimum required resource number, and the maximum required number of resources that can meet the delivery date and the maximum for each order. The margin days in the required number of resources, the earliest start possible date, the earliest completion date, the latest start possible date, the latest completion date, and the like are calculated and stored in the PERT calculation result storage unit 32.

This PERT calculation means 52 performs a process as shown in FIG. 9, for example.
In step S <b> 201, the PERT calculation unit extracts each order from the schedule data storage unit 31 expanded in the storage device 107. If it is determined in step S202 that all orders in the schedule data storage unit 31 have already been taken in (EOF: End of File), the process proceeds to step S208.

  In step S203, the work process flow information and resource information associated with the order extracted in step S201 are extracted. Here, in the work process flow information, when an arbitrary resource number process associated with a plurality of resource numbers is included, in step S204, the variable “R” is set as the minimum required resource number. In step S205, The PERT calculation by the forward path and backward path in R is executed.

  Next, “R” is incremented in step S206, and “R” is compared with the maximum required resource number in step S207. If “R” is less than or equal to the maximum required number of resources, the process returns to step S205 again to execute PERT calculation.

  If “R” exceeds the maximum required resource number in step S207, the process returns to step S201 to newly extract an order.

  After the PERT calculation is completed, in step S208, the PERT calculation means 52 deletes the calculation pattern that failed to meet the delivery date.

  In this way, the PERT calculation means 52 executes PERT calculation for each of the minimum required resource number to the maximum required resource number for each order, and the margin in the minimum required resource number and the minimum required resource number that can meet the delivery date. Calculate the number of days, the maximum number of required resources that can meet the delivery date, the number of days in the maximum required number of resources, the earliest start possible date, the earliest completion date, the latest start possible date, and the latest completion date, and PERT All of the calculation results are stored in the storage unit such as the storage device 107 as the calculation result storage unit 32 and held until all the processes are completed. For example, the PERT calculation result storage unit 32 may be provided in the RAM 103.

  Next, processing of the PERT calculation means 52 of the production scheduling apparatus 1 according to the preferred embodiment of the present invention will be described with reference to FIGS. 10 to 13 are PERT calculated in accordance with the work process shown in FIG.

10 and 11, PERT calculation is performed by the forward path. In PERT calculation by the forward path, the minimum required resource number and the maximum required resource number that can meet the delivery date, the earliest start possible date, the earliest completion date, and the spare days are calculated. Here, the work efficiency of each of the drilling process and the polishing process is 1000 pieces / day according to the example shown in FIG. 6. Therefore, when 1000 products are manufactured, each work day requires one work day. .
In FIG. 10, when March 1 is the start date and March 10 is the delivery date, the earliest start date when the packaging process can be started is March 3 in consideration of the drilling process and the polishing process. It will be a day. When one person who is the minimum required number of resources is working, the work is completed on March 7, and the remaining days until March 10, which is the delivery date, is three days. When working with 5 people, which is the maximum required number of resources, the work will be completed on March 3, and the remaining days until March 10, which is the delivery date, will be 7 days. In the example shown in FIG. 10, in the arbitrary resource number process, since the delivery date can be maintained for any specified number of resources, the minimum required number of resources is one person and the spare days at this time is 3 days. The maximum required number of resources is 5, and the spare days at this time are 7 days. The earliest possible start date of the maximum required number of resources is March 3, the earliest completion date is March 3, the earliest possible start date of the minimum required number of resources is March 3, and the earliest completion date is March 7. become.
In FIG. 11, when March 1 is the start date and March 5 is the delivery date, the earliest start date when the packaging process can be started is March 3 in consideration of the drilling process and the polishing process. It will be a day. When one person who is the minimum required number of resources works, the work is completed on March 7, and the delivery date of March 5 is passed. When the number of resources is 2, the work is completed on March 5, and the number of days left until March 5, which is the delivery date, is 0 (critical path). When working with 5 people, which is the maximum required number of resources, the work is completed on March 3, and the remaining days until March 5, which is the delivery date, is 2 days. When working with 5 people, which is the maximum required number of resources, the work is completed on March 3, and the remaining days until March 5, which is the delivery date, is 2 days. In the example shown in FIG. 11, in the arbitrary resource number process, the delivery date can be maintained when the number of specified resources is 2 or more, so the minimum required number of resources is 2 people and the number of days allowed at this time Is 0 days, the maximum required number of resources is 5, and the number of spare days at this time is 2 days. The earliest possible start date of the maximum required number of resources is March 3, the earliest completion date is March 3, the earliest possible start date of the minimum required number of resources is March 3, and the earliest completion date is March 5. become.

12 and 13, PERT calculation is performed by a backward path. In PERT calculation by the backward pass, the minimum required resource number and the maximum required resource number that can meet the delivery date, the latest start possible date, the latest completion date, and the extra days are calculated. Here, the work efficiency of each of the drilling process and the polishing process is 1000 pieces / day according to the example shown in FIG. 6. Therefore, when 1000 products are manufactured, each work day requires one work day. .
In FIG. 12, when March 1 is the startable date and March 10 is the delivery date, the latest completion date for ending the packaging process is March 10. When working with one person, the minimum required number of resources, work will start on March 6th, so until March 1st, which is the start date of this work flow considering the drilling and polishing processes The surplus days will be 3 days. When working with 5 people, the maximum required number of resources, work will start on March 10th, so until March 1st, the start date of this work flow considering the drilling and polishing processes The extra days will be 7 days. In the example shown in FIG. 12, in the arbitrary resource number process, since the delivery date can be maintained for any specified number of resources, the minimum required number of resources is one person and the spare days at this time is three days. The maximum required number of resources is 5, and the spare days at this time are 7 days. Also, the latest possible start date of the maximum required number of resources is March 10th, the latest completion date is March 10th, the latest possible start date of the minimum required number of resources is March 6th, the latest completed date is March 10th.
In FIG. 13, when March 1 is the startable date and March 5 is the delivery date, the latest completion date for ending the packaging process is March 5. When working with one person, which is the minimum required number of resources, work will start on February 27 (if it is not a leap year and February 28 if it is a leap year), so the drilling process, polishing It will be past from March 1st, which is the date when this work flow can be started in consideration of the process. When working with 2 resources, work will start on March 3, so the number of days left until March 1, which is the start date of this work flow considering the drilling process and polishing process, is Day 0 (critical path). When working with the maximum required number of 5 people, work will start on March 5th, so until March 1st, which is the start date of this work flow considering the drilling and polishing processes The surplus days will be 2 days. In the example shown in FIG. 13, in the arbitrary resource number process, since the delivery date can be observed when there are two or more of the specified number of resources, the minimum required number of resources is 2 people at this time. The spare days are 0 days (critical path), the maximum required number of resources is 5, and the spare days at this time is 2 days. Also, the latest possible start date of the maximum required number of resources is March 3 and the latest completion date is March 5. The latest possible start date of the minimum required number of resources is March 3 and the latest complete date is It will be March 5th.

  Based on these PERT calculation results, data as shown in FIG. 14 is stored in the PERT calculation result storage unit 32. The PERT calculation result storage unit 32 stores the PERT calculation result for each order for a predetermined resource (in this case, a worker). FIG. 14 (a) shows the PERT calculation result storage unit that is the PERT calculation result by the forward path for each order, and includes the minimum necessary resource number and the maximum required resource number, the earliest start date, the earliest completion date, and the spare days that can meet the delivery date 32a. FIG. 14B shows the result of PERT calculation by PERT calculation using the backward pass for each order, the minimum required resource number and the maximum required resource number that can meet the delivery date, the latest start possible date, the latest completion date, and the extra days. Is memorized. In addition, each calculation pattern from the minimum required resource number to the maximum required resource number is also stored in the PERT calculation result storage unit 32. In the example shown in FIG. 14 (a), the earliest start possible date and the earliest completion date are the same, and in the example shown in FIG. 14 (b), the latest start possible date and the latest completion date are the same. This is because each order can be completed in one day when the number of resources is maximized. For example, if multiple days are required even if the maximum number of resources that can be procured is used, the number of days from the earliest start possible date to the earliest completion date is multiple days, and the date from the latest start possible date to the latest completion date is multiple days. Become.

  The load pile processing means 53 reads the PERT calculation result storage unit 32 from the storage device 107, extracts the PERT calculation result calculated with the maximum required number of resources in the backward path for each order, and extracts the PERT calculation result from the latest possible start date. During the late completion date, for each activity, a load pile is performed so as not to exceed the maximum required resource number, and the load pile result storage unit 33 is stored, and an average necessary resource number in the period to be scheduled is calculated. And stored in the load pile result storage unit 33.

The load pile processing means 53 performs a process as shown in FIG. 15, for example.
First, in step S301, the PERT calculation result storage unit 32 is read, and a calculation result calculated with the maximum required number of resources is extracted for each order by a backward path. Next, in step S302, one order extracted in step S301 is taken out. At this time, if there is no order to be taken out, the process proceeds to step S305.

  When the order is taken out in step S303, load accumulation is performed in step S304 in the range from the latest possible start date to the latest completed date. As a result, the latest schedule allowed for each order can be set. This result is sequentially stored in the load pile result storage unit 33.

  When the load pile is performed in step S304, the process returns to step S302 to extract the next order.

  As described above, when all the orders extracted in step S301 are loaded, the average required number of resources is calculated in step S305. Specifically, if the activity is daily, subtract the schedule start date (or current date) from the schedule end date (latest completion date of the order assigned to the latest date), Calculate the number of activities (days). On the other hand, the total required amount is calculated by integrating the maximum required number of resources in order units. The total load amount calculated in this way is divided by the number of activities to calculate the average required number of resources for each activity. The calculated average required resource number is stored in the load pile result storage unit 33.

  Here, an example of the load pile result will be described with reference to FIG. FIG. 16 is created with reference to the result shown in FIG. Specifically, since the latest completion date of the order A is March 4, the load of 3 which is the maximum required number of resources is piled up on March 4. Since order B has the latest completion date of March 5, the load of 1 which is the maximum required number of resources is piled up on March 5. Since the latest completion date of the order C is March 6, the load of 2 which is the maximum necessary resource number is piled up on March 6. Since the latest completion date of the order D is March 7, the load of 5 which is the maximum required number of resources is piled up on March 7. Since the latest completion date of the order E is March 8, the load of 3 which is the maximum required number of resources is piled up on March 8. The result of the load pile as shown in FIG. 16 is stored in the load pile result storage unit 33.

  The load landslide processing means 54 reads the PERT calculation result storage unit 32 and the load pile result storage unit 33 from the storage device 107, and average required resources in the past direction from the latest completion date included in the PERT calculation result to the earliest start possible date. Load collapse is performed so as not to exceed the number, and the result is stored in the load collapse result storage unit 34.

  Specifically, the load erosion processing means 54 extracts the PERT calculation results for each order in order from the order with the highest allocation priority, searches for a free load with the load amount of the maximum required resource number, Compare the required average number of resources. Here, if it is possible to assign with the required average number of resources and the load of the already assigned order can be moved in the past direction, the assigned order is moved in the past direction and extracted to the free load after the move. When an order load is assigned and the already assigned order load cannot be moved in the past direction, the extracted order load is assigned to the free load. On the other hand, if the load that cannot be allocated with the required average number of resources and the load that exceeds the average required number of resources can be moved from the latest completion date to the past start date, the load that exceeds the average required number of resources is maximized. If the load that exceeds the average required number of resources moves in the past direction from the latest completion date to the earliest start date, and if it is not possible to move in the past direction from the latest completion date to the earliest start date, the maximum required resource number Perform allocation.

The load hillside processing means 54 performs processing as shown in FIG. 17, for example.
First, in step S401, sorting is performed in the order in which resources are preferentially allocated, such as the order with the fewest days. In the example shown in FIG. 17, the hills are crushed in the order of few days, but they may be sorted in the order in which resources are preferentially allocated according to other parameters given from the outside such as customer priority.

  Next, in step S402, one order is extracted from the order sorted in step S401 in descending order of priority. If the order cannot be taken out, it is determined that all the orders have been crushed and the process is terminated.

  On the other hand, when one order is taken out in step S402, the available load is searched with the maximum number of required resources in the range from the latest completion date to the earliest start date. Here, it is evaluated whether or not the work can be completed in a period in which the order is the shortest (vertical axis: maximum capacity, horizontal axis: minimum period) by searching for a free load with the maximum required number of resources.

  In step S405, it is determined whether or not a load is allocated below the average required resource number calculated by the load pile processing means 53 on the latest completion date calculated by the maximum required resource number.

  If it is determined in step S405 that the allocation is not less than the average required resource number, in step S406, it is possible to move the load exceeding the average required resource number in the range from the latest completion date to the earliest start date. Determine whether. If the load cannot be moved, in step S407, placement is performed with the maximum required number of resources in the direction of the earliest start date with the latest completion date as the base point. In this case, the maximum required resource number exceeds the average required resource number, but the delivery date can be kept by assigning the maximum required resource number. On the other hand, if the load can be moved, in step S408, the load exceeding the average required number of resources is crushed in the past direction in the range from the latest completion date to the earliest start date, and the searched free load is extracted in step S402. Assign the load of the ordered order. At this time, the load is moved so as not to exceed the average required number of resources. At this time, an assignment condition such as whether a load exceeding the average required resource number may be assigned to a continuous activity or a non-continuous activity may be input as a parameter from the outside.

  In the case where the allocation is less than the average required number of resources in step S405, it is determined in step S409 whether the load of the already allocated order can move the load in the past direction within the range in which the order can be allocated. When the load can be moved, in step S410, the load of the already assigned order is moved in the past direction, and the load of the order taken out in step S402 is assigned to the empty load generated by the movement. On the other hand, if the load cannot be moved, the load of the order extracted in step S402 is assigned to the empty load on the latest completion date.

  The load landslide will be described based on the processing result of the specific load pile shown in FIG. In the example shown in FIG. 16, the load landslide processing means 54 sorts in the order of order B and order C, order A, order D, and order E based on the number of days.

  First, as for order B and order C, since the number of days is 0, the load is piled up on the latest completion date as shown in FIG.

  Next, for order D, five loads are piled up on March 7 which is the latest completion date by the load pile processing means 53, but the piled loads exceed 3 which is the average required number of resources. The load landslide processing means 54 moves the load in the past direction as shown in FIG. At this time, the load landslide processing means 54 searches for a free load retroactively from the latest completion date to the earliest start possible date. Specifically, as shown in FIG. 16, the order D can be assigned a load between March 5 and March 7 because the earliest startable date is March 5. For two loads exceeding the average required number of resources, first, it is searched whether there is a free load on March 6 that goes back one day in the past. On March 6, two loads are assigned by order C. However, since there is one free load up to the average required number of resources, order D is assigned to one free load on March 6. . Further, a search is made as to whether or not there is an idle load on March 5 that goes back one day in the past. On March 5th, one load is assigned by order B. Since there are two free loads up to the average required number of resources, order D is assigned to one free load on March 5th. . By processing in this way, the load of the order D is allocated from the latest completion date to the earliest start possible date so as not to exceed the average required number of resources.

  Next, for order A, three loads are piled up on March 4th, which is the latest completion date, by the load pile processing means 53, but the piled load is “3”, which is the average number of required resources. Since it does not exceed, loads are piled up on the latest completion date as shown in FIG.

  Next, for order E, three loads are piled up on March 8th, which is the latest completion date, by the load pile processing means 53, but the piled loads are set to “3”, which is the average required number of resources. Since it does not exceed, the load is piled up on the latest completion date. Here, the load landslide processing means 54 verifies whether or not the load that has already been allocated can be moved in the past direction within the allocation range. Here, the earliest possible start date of order A is March 1, and order A has less time for delivery than order E. Therefore, as shown in FIG. The load of the order E is moved on March 4 when the load of the order A has become a free load.

  By performing such a load collapse process, by performing a load collapse in the past direction so as not to exceed the average required number of resources, the number of resources can be leveled while observing the delivery date.

  The schedule result output means 55 reads the load devastating result storage unit 34 from the storage device 107, associates the orders assigned to the resources for each resource and unit time, and stores them in the resource-specific schedule result storage unit 41, for each order. The resource assigned to the item and the delivery schedule are associated with each other and stored in the order-specific schedule result storage unit 42.

  In the schedule result output means 55, conditions such as order order, process order, delivery date order, and order with few days of allowance may be designated and output by parameters. The resource-specific schedule result storage unit 41 and the order-specific schedule result storage unit 42 may be transmitted to a higher-level system such as a production management system and stored in the production management system, or in an arbitrary format by the production management system or the like. May be presented. At this time, the schedule result may be presented using a Gantt chart or the like.

  As described above, the production scheduling apparatus 1 according to the best embodiment of the present invention first performs load accumulation under the most severe postponement conditions, and performs load collapse in the past direction so as not to exceed the average required number of resources. As a result, the number of resources can be leveled while observing the delivery date. By leveling the number of resources, for example, workers can be hired for the long term by the same member, so that no new employment is generated, so there is no extra cost related to worker education or employment. Further, by allowing the same worker to continue working, the proficiency level of this worker can be increased, and effects related to quality such as reduction of defective products and improvement of yield are expected.

(Other embodiments)
As described above, the present invention has been described according to the best mode for carrying out the invention. However, it should not be understood that the description and drawings constituting a part of this disclosure limit the present invention. From this disclosure, various alternative embodiments, examples, and operational techniques will be apparent to those skilled in the art.

  The present invention may include various embodiments not described herein. Therefore, the technical scope of the present invention is defined only by the invention specifying matters according to the scope of claims reasonable from the above description.

The functional block diagram of the production scheduling apparatus which concerns on the best embodiment of this invention. The hardware block diagram of the production scheduling apparatus which concerns on the best embodiment of this invention. The flowchart explaining the main processes of the production scheduling apparatus which concerns on the best embodiment of this invention. The figure explaining an example of the data structure and data of the order information storage part which concerns on the best embodiment of this invention. The figure explaining an example of the data structure and data of the work process flow information storage part which concerns on the best embodiment of this invention. The figure explaining the data structure and example of data of the work process information storage part which concerns on the best embodiment of this invention. The figure explaining an example of the data structure and data of the resource group information storage part which concerns on the best embodiment of this invention. The figure explaining an example of the data structure of the resource information storage part which concerns on the best embodiment of this invention, and data. An example of the flowchart of the PERT calculation means based on the best embodiment of this invention. The figure explaining PERT calculation performed by a forward path in the PERT calculation processing means which concerns on the best embodiment of this invention. (Part 1) The figure explaining PERT calculation performed by a forward path in the PERT calculation processing means which concerns on the best embodiment of this invention. (Part 2) The figure explaining PERT calculation performed by a backward path | pass in the PERT calculation process means which concerns on the best embodiment of this invention. (Part 1) The figure explaining PERT calculation performed by a backward path | pass in the PERT calculation process means which concerns on the best embodiment of this invention. (Part 2) The figure explaining an example of the data structure and data of the PERT calculation result storage part which concerns on the best embodiment of this invention. An example of the flowchart of the load pile processing means which concerns on the best embodiment of this invention. An example of the processing result by the load pile processing means which concerns on the best embodiment of this invention. An example of the flowchart of the load landslide processing means which concerns on the best embodiment of this invention. An example of the processing result by the load landslide processing means which concerns on the best embodiment of this invention. (Part 1) An example of the processing result by the load landslide processing means which concerns on the best embodiment of this invention. (Part 2) An example of the processing result by the load landslide processing means which concerns on the best embodiment of this invention. (Part 3) An example of the processing result by the load landslide processing means which concerns on the best embodiment of this invention. (Part 4)

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 ... Production scheduling apparatus 21 ... Order information storage part 22 ... Work process flow information storage part 23 ... Work process information storage part 24 ... Resource group information storage part 25 ... Resource information storage part 31 ... Schedule data storage part 32 ... PERT calculation result Storage unit 33 ... Load pile result storage unit 34 ... Load landslide result storage unit 41 ... Resource-specific schedule result storage unit 42 ... Order-specific schedule result storage unit 51 ... Schedule data fetching means 52 ... PERT calculation means 53 ... Load pile processing means 54 ... Load-climbing processing means 55 ... Schedule result output means 101 ... Central processing control device 102 ... ROM
103 ... RAM
104 ... Input device 105 ... Display device 106 ... Communication control device 107 ... Storage device 108 ... Removable disk 109 ... Input / output interface 110 ... Bus

Claims (8)

In order to manufacture product items, the number of resources required per unit time is leveled and optimized in an arbitrary resource count process where work is performed with a predetermined resource count between the minimum required resource count and the maximum required resource count. In the production scheduling device that calculates the number of resources,
Order information including product item, production quantity, start date and delivery date, resource name, minimum required resource number, maximum required resource number, work based on the unit time used in the arbitrary resource number process for manufacturing this product item Storage means for storing work process information associated with efficiency;
The order information and the work process information are read from the storage means, and the order information of the order to be scheduled and the work process information associated with the product item included in the order information are extracted, and the schedule data Schedule data fetching means stored in the storage means as
Read the schedule data from the storage means, and execute PERT calculation for calculating the forward path and the backward path with the respective resource numbers between the minimum required resource number and the maximum required resource number in the arbitrary resource number process for each order. For each order, the minimum required number of resources for protecting the delivery date, the number of days for the minimum required number of resources, the maximum number of required resources for protecting the delivery date, the number of days for the maximum required number of resources, and the earliest PERT calculation means for calculating a startable date, the latest startable date, and the latest completion date, and storing them in the storage means as a PERT calculation result;
The PERT calculation result is read from the storage means, and the PERT calculation result calculated with the maximum required number of resources in the backward path is extracted for each order, and the unit time is calculated based on the extracted PERT calculation result. A load pile is performed so as not to exceed the maximum required resource number, and the load pile result is stored in the storage means, and the average required resource number per unit time in a period to be scheduled is calculated, and the load pile result Load pile processing means stored in the storage means as
The PERT calculation result and the load pile result are read from the storage means, and the average required resource number is exceeded in the past direction based on the minimum required resource number and the maximum required resource number for each order in the PERT calculation result. A load scheduling process unit that performs load collapse so as not to be stored and stores the result in the storage unit as a load collapse result. Reading the load collapse result from the storage means, and the resource-specific schedule result associated with the order assigned to the resource for each resource and for each unit time, the resource assigned for each order, and the delivery schedule The production scheduling apparatus according to claim 1, further comprising: a schedule result output unit that stores, in the storage unit, an order-by-order schedule result associated with. The load pile processing means reads the PERT calculation result from the storage means, extracts the PERT calculation result calculated with the maximum required number of resources in the backward path for each order, and starts the latest start date During the latest completion date, a load pile is performed for each unit time so as not to exceed the maximum required number of resources, and the load pile result is stored in the storage means, and the average necessary for the period to be scheduled Calculate the number of resources, and store it in the storage means as the load pile result,
The load landslide processing means reads the PERT calculation result and the load pile result from the storage means, and the average required resource in the past direction from the latest completion date included in the PERT calculation result to the earliest startable date The production scheduling apparatus according to claim 1 or 2, wherein load collapse is performed so as not to exceed a number, and the result of load collapse is stored in the storage means. The load landslide processing means extracts the PERT calculation result for each order in order from the order of higher allocation priority,
Search for a free load with the load amount of the maximum required resource number, compare the maximum required resource number with the required average resource number,
If it is possible to allocate the required average number of resources and move the already allocated order load in the past direction, move the allocated order in the past direction and move the extracted order load If the load of the already assigned order is not movable in the past direction, the load of the extracted order is assigned to the free load.
When the load that cannot be allocated with the required average number of resources and exceeds the average required number of resources can be moved from the latest completion date to the past of the earliest start date, the average required number of resources is exceeded. The load is moved in the past direction from the latest completion date to the earliest start date, and the load exceeding the average required resource number is not movable in the past direction from the latest completion date to the earliest start date The production scheduling apparatus according to claim 3, wherein allocation is performed based on the maximum required resource number. In order to manufacture product items on a computer, the required number of resources is leveled per unit time in an arbitrary number of resources process in which work is executed with a predetermined number of resources between the minimum required resource count and the maximum required resource count. In a production scheduling program that calculates the optimal number of resources,
From the storage means, order information including product item, production quantity, start date and delivery date, resource name, minimum required resource number, maximum required resource number used in the arbitrary resource number process for manufacturing this product item, the unit The work process information associated with the work efficiency based on the time is read out, the order information in which the order to be scheduled is stored, and the work process information associated with the product item included in the order information are extracted. Schedule data fetching means for storing the schedule data in the storage means;
Read the schedule data from the storage means, and execute PERT calculation for calculating the forward path and the backward path with the respective resource numbers between the minimum required resource number and the maximum required resource number in the arbitrary resource number process for each order. For each order, the minimum required number of resources that can meet the delivery date, the number of days required for the minimum required number of resources, the maximum required number of resources that can meet the delivery date, and the maximum required number of resources PERT calculation means for calculating the number of days in the table, the earliest startable date, the latest startable date, and the latest completion date, and storing them in the storage means as a PERT calculation result;
The PERT calculation result is read from the storage means, and the PERT calculation result calculated with the maximum required number of resources in the backward path is extracted for each order, and the unit time is calculated based on the extracted PERT calculation result. A load pile is performed so as not to exceed the maximum required resource number, and the load pile result is stored in the storage means, and the average required resource number per unit time in a period to be scheduled is calculated, and the load pile result Load pile processing means stored in the storage means as
The PERT calculation result and the load pile result are read from the storage means, and the average required resource number is determined in the past direction based on the minimum required resource number and the maximum required resource number for each order in the PERT calculation result. A production scheduling program characterized by causing a computer to execute a load landslide so as not to exceed the load landscaping and storing the load landslide processing means stored in the storage means as a load landslide result. Reading the load collapse result from the storage means, and the resource-specific schedule result associated with the order assigned to the resource for each resource and for each unit time, the resource assigned for each order, and the delivery schedule The production scheduling program according to claim 5, further causing the computer to execute schedule result output means for storing in the storage means the order-specific schedule result associated with. The load pile processing means reads the PERT calculation result from the storage means, extracts the PERT calculation result calculated with the maximum required number of resources in the backward path for each order, and starts the latest start date During the latest completion date, a load pile is performed for each unit time so as not to exceed the maximum required number of resources, and the load pile result is stored in the storage means, and the average necessary for the period to be scheduled Calculate the number of resources, and store it in the storage means as the load pile result,
The load landslide processing means reads the PERT calculation result and the load pile result from the storage means, and the average required resource in the past direction from the latest completion date included in the PERT calculation result to the earliest startable date 7. The production scheduling program according to claim 5, wherein load collapse is performed so as not to exceed a number, and a load collapse result is stored in the storage means. The load landslide processing means extracts the PERT calculation result for each order in order from the order of higher allocation priority,
Search for a free load with the load amount of the maximum required resource number, compare the maximum required resource number with the required average resource number,
If the load of the already allocated order can be moved in the past direction and can be allocated with the required average number of resources, the order extracted in the free load after movement by moving the allocated order in the past direction If the load of the already assigned order is not movable in the past direction, the load of the extracted order is assigned to the free load, and
When the load that cannot be allocated with the required average number of resources and exceeds the average required number of resources can be moved from the latest completion date to the past of the earliest start date, the average required number of resources is exceeded. The load is moved in the past direction from the latest completion date to the earliest start date, and the load exceeding the average required resource number is not movable in the past direction from the latest completion date to the earliest start date In this case, the production scheduling program according to claim 7, wherein the allocation is performed with the maximum required number of resources.

Images