JP6776161B2 - Simulation equipment and method - Google Patents

Description

The present invention is included in a lot when jobs processed under the same processing conditions in each process are collectively processed in a lot in a production line in which a plurality of types of jobs are processed in a plurality of processes to manufacture a product. It relates to a simulation apparatus and a method for executing a simulation for determining whether or not to start job processing.

Conventionally, in a production line that produces a large number of types of products through a large number of processes, a plurality of products are collectively processed under the same processing conditions for each process from the viewpoint of production cost and efficiency. There is. This collectively processed unit is referred to as a "lot". When grouping into lots, it is more efficient to process as many jobs of the same type as possible because it is possible to reduce the labor and time required for setup changes to change the processing conditions. However, it is not preferable to put the job on standby without starting the processing for the job in order to increase the number of lots to be put together, because it causes a delay in delivery of the product and an increase in the inventory amount in the intermediate process.

Therefore, for processing conditions where it is difficult to prepare jobs for batching into lots, it is important to appropriately determine when to start processing for jobs to improve production efficiency, reduce inventory in intermediate processes, and comply with product delivery dates. From this point of view, it is an issue.

In the technique described in Patent Document 1, the minimum number of jobs to be put together in a lot and the maximum waiting time that a job can wait when putting together a lot are set in advance. When the minimum number of jobs arrives at the process, it is determined that the lots are complete. The first job to arrive at the process cannot wait beyond the maximum wait time. Then, in the technique described in Patent Document 1, when it is found that the minimum number of lots is not prepared by the maximum waiting time, the job processing is started without waiting the job until the maximum waiting time. This avoids a situation where the job is wasted waiting.

Japanese Patent No. 4846995

However, with respect to the technique described in Patent Document 1, from the viewpoints of improving production efficiency, reducing inventory in intermediate processes, and observing delivery dates of products, we are waiting for jobs to be prepared in order to perform lot batch processing. At times, it is desired to more appropriately determine when to start processing a job.

The present invention solves the above-mentioned problems, and can more appropriately determine when the processing for a job should be started while waiting for the jobs to be prepared in order to perform the lot batch processing. It is an object of the present invention to provide a simulation device and a method.

The first aspect of the present invention is
In a production line that manufactures the plurality of types of products by processing a plurality of types of jobs in a predetermined order in a predetermined order among a plurality of processes, the processing conditions for processing the jobs in the passing process are the same. A simulation device that executes a simulation for determining whether or not to start processing the jobs included in the lot when the above jobs are collectively processed as a lot and continuously processed in the passing process.
Planned data storage in which the plurality of types of jobs, the passing process for each of the plurality of types of jobs, and the types of processing conditions for processing the plurality of types of jobs in the passing process are stored in advance. Department and
The type of the processing condition in the passing process, the minimum number of jobs constituting the lot determined to be complete, which are preset for each type of the processing condition, and the preset for each type of the processing condition. , A lot in which lot conditions including a maximum waiting time that the job can wait without being processed after the first job constituting the lot arrives in the passing process are stored in advance for each passing process. Condition storage and
Using the plurality of types of jobs and the types of the processing conditions stored in the planning target data storage unit and the types of the processing conditions included in the lot conditions stored in the lot condition storage unit, A job classification unit that classifies the plurality of types of jobs as lot candidates constituting the lot for each type of processing conditions.
A simulation time setting unit that sets the simulation time, which is the time to execute the simulation,
For each of the passing steps, for the job whose processing has not started at the simulation time, assuming that there is no waiting time for processing in all the passing steps, at the time when the job is scheduled to arrive at the passing step. The earliest arrival time calculation unit that calculates a certain earliest arrival time,
For the lot whose processing has not started at the simulation time, the job classified as the lot candidate by using the earliest arrival time and the minimum number included in the lot condition is the minimum for each lot. The earliest lot completion time calculation unit that calculates the earliest lot completion time, which is the earliest time to complete the quantity,
For the lot for which processing has not started at the simulation time, the time when the first job classified as the lot candidate arrives at the passing process and the time when the first job classified as the lot candidate arrives at the passing process are stored in the lot condition storage unit for each lot. A lot waiting limit time calculation unit that calculates the lot waiting limit time, which is the latest time that the first job can wait, using the maximum waiting time included in the lot condition.
For the lot whose processing has not started at the simulation time, the earliest lot start time calculation unit that calculates the earliest lot start time for each lot,
For the lot for which processing has not been started at the simulation time, a lot processing determination unit for determining whether or not to start processing of the job classified as the lot candidate for each lot.
With
The earliest lot start time calculation unit determines whether or not the earliest lot completion time is later than the lot waiting limit time, and if it is determined that the earliest lot completion time is not later than the lot waiting limit time, the earliest lot When the completion time is calculated as the earliest lot start time and it is determined that the earliest lot completion time is later than the lot waiting limit time, the job classified as the lot candidate arrives earlier than the lot waiting limit time. The earliest arrival time of the latest arrival job, which is the latest arrival job among the jobs, is calculated as the earliest lot start time.
When the simulation time is earlier than the earliest lot start time, the lot processing determination unit determines that the processing of the job classified as the lot candidate is not started, and when the simulation time is after the earliest lot start time. , It is determined that the processing of the job classified as the lot candidate is started.

The second aspect of the present invention is
In a production line that manufactures the plurality of types of products by processing a plurality of types of jobs in a predetermined order in a predetermined order among a plurality of processes, the processing conditions for processing the jobs in the passing process are the same. A simulation method for executing a simulation for determining whether or not to start processing the jobs included in the lot when the above jobs are collectively processed as a lot and continuously processed in the passing process.
The simulation method is
Planned data storage in which the plurality of types of jobs, the passing process for each of the plurality of types of jobs, and the types of processing conditions for processing the plurality of types of jobs in the passing process are stored in advance. Department and
The type of the processing condition in the passing process, the minimum number of jobs constituting the lot determined to be complete, which are preset for each type of the processing condition, and the preset for each type of the processing condition. , A lot in which lot conditions including a maximum waiting time that the job can wait without being processed after the first job constituting the lot arrives in the passing process are stored in advance for each passing process. Condition storage and
Used in simulation equipment equipped with
The simulation method is
Using the plurality of types of jobs and the types of the processing conditions stored in the planning target data storage unit and the types of the processing conditions included in the lot conditions stored in the lot condition storage unit, A job classification step for classifying the plurality of types of jobs as lot candidates constituting the lot for each type of processing conditions, and
A simulation time setting step for setting the simulation time, which is the time for executing the simulation, and
For each of the passing steps, for the job whose processing has not started at the simulation time, assuming that there is no waiting time for processing in all the passing steps, at the time when the job is scheduled to arrive at the passing step. The earliest arrival time calculation step to calculate a certain earliest arrival time,
For the lot whose processing has not started at the simulation time, the job classified as the lot candidate by using the earliest arrival time and the minimum number included in the lot condition is the minimum for each lot. The earliest lot completion time calculation step to calculate the earliest lot completion time, which is the earliest time to complete the quantity,
For the lot for which processing has not started at the simulation time, the time when the first job classified as the lot candidate arrives at the passing process and the time when the first job classified as the lot candidate arrives at the passing process are stored in the lot condition storage unit for each lot. A lot waiting limit time calculation step for calculating the lot waiting limit time, which is the latest time that the first job can wait, using the maximum waiting time included in the lot condition, and
For the lot whose processing has not been started at the simulation time, the earliest lot start time calculation step for calculating the earliest lot start time for each lot, and
For the lot whose processing has not been started at the simulation time, a lot processing determination step for determining whether or not to start processing of the job classified as the lot candidate for each lot.
With
The earliest lot start time calculation step determines whether or not the earliest lot completion time is later than the lot waiting limit time, and if it is determined that the earliest lot completion time is not later than the lot waiting limit time, the earliest lot When the completion time is calculated as the earliest lot start time and it is determined that the earliest lot completion time is later than the lot waiting limit time, the job classified as the lot candidate arrives earlier than the lot waiting limit time. The earliest arrival time of the latest arrival job, which is the latest arrival job among the jobs, is calculated as the earliest lot start time.
The lot processing determination step determines that processing of the job classified as the lot candidate is not started when the simulation time is earlier than the earliest lot start time, and when the simulation time is after the earliest lot start time. , It is determined that the processing of the job classified as the lot candidate is started.

In the first and second aspects, it is determined for each lot whether or not the earliest lot completion time is later than the lot waiting limit time for the lots for which processing has not been started at the simulation time. If the lot completion time is not later than the lot waiting limit time, the minimum number of jobs constituting the lot will be prepared by the lot waiting limit time. In this case, the earliest lot completion time is calculated as the earliest lot start time. When the simulation time is after the lot start time, it is determined that the processing of the jobs classified as lot candidates is started. Therefore, it is possible to start processing a lot in which the minimum number of jobs is complete.

On the other hand, when the lot completion time is later than the lot waiting limit time, the minimum number of jobs constituting the lot is not prepared by the lot waiting limit time. In this case, the earliest arrival time of the latest arrival job, which is a job classified as a lot candidate and arrives earlier than the lot waiting limit time, is calculated as the earliest lot start time. When the simulation time is after the lot start time, it is determined that the processing of the jobs classified as lot candidates is started. Therefore, although the minimum number of jobs is not available, all jobs arriving by the lot waiting limit time can be processed as lots. As a result, it is possible to more appropriately determine when the processing for the job should be started while waiting for the jobs to be prepared for the lot batch processing.

In the first aspect, for example, when the earliest lot start time calculation unit determines that the earliest lot completion time is later than the lot waiting limit time, the lot candidate is selected at the earliest arrival time of the latest arrival job. When the processing of the classified jobs is started, the total waiting time, which is the total waiting time of all the jobs for which processing is started, until the earliest arrival time of the latest arrival job is calculated. A waiting time calculation unit may be further provided. The lot condition storage unit may store a predetermined reference waiting time. When the earliest lot start time calculation unit determines that the earliest lot completion time is later than the lot waiting limit time, the reference waiting time is further compared with the total waiting time, and the reference waiting time is the total waiting time. When it is more than an hour, the earliest arrival time of the latest arrival job is calculated as the earliest lot start time, and when the reference waiting time is less than the total waiting time, the simulation time is used as the earliest lot start time. You may calculate.

In this embodiment, when the lot completion time is later than the lot waiting limit time, the minimum number of jobs constituting the lot is not prepared by the lot waiting limit time. At this time, when the processing of the jobs classified as lot candidates is started at the earliest arrival time of the latest arrival job, the waiting time until the earliest arrival time of the latest arrival job of all the jobs for which the processing is started The total waiting time, which is the total of, is calculated. If it is determined that the earliest lot completion time is later than the lot waiting limit time, the reference waiting time and the total waiting time are further compared.

When the reference waiting time is equal to or greater than the total waiting time, the earliest arrival time of the latest arrival job is calculated as the earliest lot start time. Therefore, if the reference wait time is set to a large value, lots will be composed of as many jobs as possible. As a result, the setup change time for changing the processing conditions is reduced, so that the productivity can be improved.

On the other hand, when the reference waiting time is less than the total waiting time, the simulation time is calculated as the earliest lot start time. Therefore, if the reference waiting time is set to a small value, lot processing is started even if only one job has arrived. As a result, the number of jobs waiting to be processed in the process is reduced, so that it is possible to suppress job retention.

In the first aspect, for example, in the reference waiting time, when the total processing time of the job corresponding to the type of the processing condition in the passing process is long for each type of the processing condition in the passing process. It may be set to a larger value than when it is short.

The fact that the total processing time of jobs corresponding to the types of processing conditions in the passing process is long means that the load on the process is higher than when it is short, and it is desired to improve productivity. .. Therefore, according to this aspect, it is possible to improve the productivity by setting the reference waiting time to a large value.

In the first aspect, for example, when the lot processing determination unit determines whether or not to start the processing of the job classified as the lot candidate, the simulation time setting unit is after the current simulation time. Therefore, the earliest time among the calculated earliest arrival time to the passing process and the processing end time for the job in the passing process may be set to the next simulation time.

In this embodiment, the earliest time among the calculated earliest arrival time to the passing process and the processing end time for the job in the passing process, which is after the current simulation time, is set as the next simulation time. To. Therefore, according to this aspect, the simulation time can be set to the turning point time without omission.

According to the present invention, it is possible to more appropriately determine when the processing for a job should be started while waiting for the jobs to be prepared in order to perform the lot batch processing.

It is a block diagram which shows typically an example of the structure of the simulation apparatus in 1st Embodiment. It is a timing chart which shows an example of the movement of a job at a simulation time roughly. It is a timing chart which shows an example of the movement of a job at a simulation time roughly. It is a timing chart which shows an example of the movement of a job at a simulation time roughly. It is a timing chart which shows an example of the movement of a job at a simulation time roughly. It is a timing chart which shows the earliest arrival time before the start of lot processing is decided at the simulation time. 6 is a timing chart showing the earliest arrival time updated after the start of lot processing is determined at the same simulation time as in FIG. It is a timing chart for demonstrating the characteristic of the operation of 1st Embodiment. It is a timing chart which shows an example of the movement of a job at a simulation time according to 1st Embodiment. It is a timing chart which shows an example of the movement of a job at a simulation time according to 1st Embodiment. It is a timing chart which shows an example of the movement of a job at a simulation time according to 1st Embodiment. It is a timing chart which shows an example of the movement of a job at a simulation time according to 1st Embodiment. It is a flowchart which shows typically an example of the operation procedure of the simulation apparatus in 1st Embodiment. It is a flowchart which shows typically an example of the operation procedure of the simulation apparatus in 1st Embodiment. It is a block diagram which shows typically an example of the structure of the simulation apparatus in 2nd Embodiment. It is a timing chart for demonstrating the outline of the operation of 2nd Embodiment. It is a flowchart which shows typically an example of the operation procedure of the simulation apparatus in 2nd Embodiment. It is a flowchart which shows typically an example of the operation procedure of the simulation apparatus in 2nd Embodiment.

(Knowledge on which the present invention is based)
First, in order to explain the findings underlying the present invention, the techniques described in Patent Document 1 will be described in detail. As described above, in the technique described in Patent Document 1, the minimum number of jobs to be put together in a lot and the maximum waiting time that a job can wait when putting together a lot are set in advance. The maximum waiting time is the maximum time that a job can wait without being processed. If the processing for the job is started when the maximum waiting time elapses, the maximum waiting time is the time from the processing completion time of the immediately preceding process to the processing start time of the process.

In the technique described in Patent Document 1, a simulation for calculating the arrival time and the like of each job at each process is executed at a predetermined simulation time. First, for jobs that have not yet been processed at the simulation time, the earliest arrival time to the remaining post-process is calculated. The earliest arrival time is the time when the calculated job is expected to arrive at the calculated process, assuming that the calculated job is not disturbed by other jobs. Since it is assumed that the job to be calculated is not disturbed by other jobs, this estimated arrival time is the earliest time that the job to be calculated can arrive at the process to be calculated.

The earliest arrival time will be updated in the future as the simulation progresses. That is, when a new simulation is executed, the earliest arrival time usually moves to a later time as compared with the previous simulation. Because, in reality, the job to be calculated is disturbed by other jobs. That is, the job to be calculated is waiting without being processed if another job is being processed. Therefore, the estimated arrival time of the job to be calculated for each process is gradually delayed.

Next, in a certain facility, it is considered to combine jobs whose processing is executed under the same processing conditions into one lot. At that time, the earliest lot completion time, which is the time when the minimum number of lots that can be made is the earliest, is calculated using the earliest arrival time of each job.

Then, it may be found at the simulation time that if the jobs constituting the lot are made to wait without being processed until the lot completion time, a job that violates the constraint of the maximum waiting time will occur. In that case, even if the minimum number is not complete, it is determined that the processing of the jobs constituting the lot is started at the simulation time.

Therefore, according to the technique described in Patent Document 1, if it is determined that the minimum number of jobs is not prepared by the time when the maximum waiting time that the job can wait without being processed elapses, the job is processed. Is started. Therefore, the job is not kept waiting until the maximum waiting time. As a result, it is possible to avoid causing unnecessary waiting for the job, shorten the lead time in manufacturing the product, and prevent the delivery date from being delayed.

As described above, in the technique described in Patent Document 1, it is determined that the processing of the jobs constituting the lot is started when it is determined that the minimum number of jobs is not prepared by the maximum waiting time. Therefore, if you wait a little longer, even if you can increase the number of jobs that make up the lot, the process will start without waiting. Therefore, an excessively small number of jobs may be processed as a lot. As a result, the work and time for changing the setup for changing the processing conditions increases.

Therefore, the present inventor has come up with a technique for preventing a lot in which the number of jobs is excessively small even when the minimum number of jobs set in the lot is not completed by the maximum waiting time. I arrived. As a result, it is possible to suppress an increase in the number and time of setup changes, and it is possible to increase productivity.

Further, the present inventor has the technique described in Patent Document 1 that determines that the processing of the jobs constituting the lot is started when it is determined that the minimum number of jobs is not prepared by the maximum waiting time, and the maximum. If the minimum number of jobs is not available by the waiting time, it is determined that the processing of the jobs included in the lot will start at the earliest arrival time of the latest arrival job among the jobs whose earliest arrival time is earlier than the lot waiting limit time. We have come up with a technology to switch between the forms to be used according to the situation. This made it possible to generate a production schedule according to the status of the process.

(Embodiment)
Hereinafter, embodiments of the present invention will be described with reference to the drawings. In each drawing, the same reference numerals are used for the same components, and detailed description thereof will be omitted as appropriate.

(Structure of the first embodiment)
FIG. 1 is a block diagram schematically showing an example of the configuration of the simulation device 100 according to the first embodiment. As shown in FIG. 1, the simulation device 100 in the first embodiment includes a display 110, an input unit 120, a memory 130, a storage device 140, and a central processing unit (CPU) 150.

The simulation device 100 in the first embodiment supports the creation of a production schedule in a production line that manufactures a plurality of types of products through a plurality of steps. Semi-finished products, which are materials for manufacturing each product, go through each process in a predetermined order. In each process, each semi-finished product is processed in a predetermined facility under predetermined processing conditions. There is a one-to-one correspondence between processes and equipment. Even in the same process (that is, the same equipment), the processing conditions may differ depending on the semi-finished product to be processed.

Semi-finished products that pass through each process in a predetermined order are called "jobs". Jobs are transported from process to process and processed in each process, resulting in the production of products. The processing for a semi-finished product (job) in each process is called a "task". In each process, tasks are executed in order for different jobs.

The display 110 includes, for example, a liquid crystal display panel. The display 110 is controlled by the CPU 150 and displays, for example, a Gantt chart showing a production schedule. The display 110 is not limited to the liquid crystal display panel. The display 110 may include other panels such as an organic EL (electroluminescence) panel.

The input unit 120 includes, for example, a mouse and a keyboard. When the input unit 120 is operated by the user, the input unit 120 outputs an operation signal indicating the operation content to the CPU 150. When the display 110 is a touch panel type display, the touch panel type display may also serve as the input unit 120 instead of the mouse and the keyboard.

The memory 130 is composed of, for example, a semiconductor memory or the like. The memory 130 includes, for example, a read-only memory (ROM), a random access memory (RAM), an electrically erasable and rewritable ROM (EEPROM), and the like. The ROM of the memory 130 stores the control program of the first embodiment for operating the CPU 150.

By operating the CPU 150 according to the control program of the first embodiment stored in the memory 130, the job classification unit 151, the simulation time setting unit 152, the earliest arrival time calculation unit 153, the earliest lot completion time calculation unit 154, and the lot It has the functions of a waiting limit time calculation unit 155, an earliest lot start time calculation unit 156, a lot processing determination unit 157, and a schedule generation unit 158. Each function of the CPU 150 will be described later.

The storage device 140 is composed of, for example, a hard disk, a semiconductor memory, or the like. The storage device 140 includes a plan target data storage unit 141, a lot condition storage unit 142, a job information storage unit 143, a schedule master storage unit 144, and a schedule storage unit 145. Each storage unit 141 to 145 may be composed of different media from each other. Alternatively, each storage unit 141 to 145 may be composed of one medium in which the storage area is divided.

The planning target data storage unit 141 stores in advance the job number, the passing process, and the type of processing conditions in the passing process. The job number represents a number that identifies the product to be produced. In this first embodiment, jobs J1, J2 and the like (FIG. 2 and the like described later) are used as an example of the job number. The passing process represents the sequence of processes in which the job is processed. Each job is processed under predetermined processing conditions in each process by the equipment corresponding to the process.

In this specification, equipment A (described later in FIG. 2 and the like), equipment X (described later in FIG. 8 and the like) and the like are used as examples of equipment, and processing conditions A1 and A2 are used as examples of the types of processing conditions in equipment A. (FIG. 2 and the like described later) and the like are used, and processing condition X1 (FIG. 8 and the like described later) and the like are used as an example of the types of processing conditions in the equipment X.

The lot condition storage unit 142 stores the maximum waiting time and the minimum number in advance. The maximum waiting time and the minimum number are predetermined for each type of processing conditions set for each facility. For example, even under the same processing condition of "heating at 500 ° C.", "heating at 500 ° C. in equipment A" and "heating at 500 ° C. in equipment B" are different. In this way, the "type of processing conditions" is determined as a set with the equipment. Therefore, the maximum waiting time and the minimum number are stored in the lot condition storage unit 142 in association with the combination of the equipment and the type of processing condition.

As described above, the maximum waiting time is the maximum time that a job can wait. The minimum number is a value for determining whether or not the lots are complete. When the minimum number of jobs arrives at the equipment (process), it is determined that the lots are complete.

The data stored in the lot condition storage unit 142 and the data stored in the planning target data storage unit 141 can be associated with each other via "the type of processing condition set according to the equipment". It is possible.

The job information storage unit 143 stores the lot condition classification, the earliest arrival time, and the processing information. The lot condition classification is generated by the job classification unit 151. The job classification unit 151 describes the types of processing conditions stored in the lot condition storage unit 142 for each facility and the processing conditions in the passing process corresponding to the job numbers stored in the planning target data storage unit 141. From the type, a set of job numbers that are lot candidates that can be aggregated as a lot for each type of processing condition is generated as a lot condition classification. The job classification unit 151 stores the generated lot condition classification in the job information storage unit 143.

The earliest arrival time is calculated by the earliest arrival time calculation unit 153. As described above, the earliest arrival time is the time when the job to be calculated is expected to arrive at the equipment (process) to be calculated, assuming that the job to be calculated is not disturbed by other jobs. Since it is assumed that the job to be calculated is not disturbed by other jobs, this estimated arrival time is the earliest time that the job to be calculated can arrive at the equipment (process) to be calculated. The earliest arrival time calculation unit 153 stores the earliest arrival time in the job information storage unit 143 in association with the job number and the equipment (process).

The processing information indicates whether the job has been processed or not processed in each facility (process). The processing information is generated by the lot processing determination unit 157. The lot processing determination unit 157 stores the generated processing information in the job information storage unit 143 in association with the job number and the equipment (process). For unprocessed jobs, the earliest arrival time is recalculated at the simulation time, as described below.

The schedule master storage unit 144 stores the processing time and the setup change time in advance. The processing time is the time required to process a job (semi-finished product) in the equipment (process). In other words, the processing time is the execution time of the task. The processing time has a different value depending on the type of processing condition. Therefore, the processing time is stored in the schedule master storage unit 144 in association with the equipment (process) and the type of processing condition. As the processing time, a value determined as a work standard may be stored. Alternatively, as the processing condition, the past actual value, that is, the processing time when the processing condition of the target type is executed by using the target equipment may be stored.

The setup change time is the time required to change the processing conditions in the target equipment. The setup change time is stored in the schedule master storage unit 144 in association with the equipment, the type of the processing condition before the change, and the type of the processing condition after the change. The setup change time may be set in the same manner as the above processing time. That is, a value determined as a work standard may be stored as the setup change time. Alternatively, as the setup change time, the past actual value, that is, the setup change when the change from the processing condition of the type before the change to the processing condition of the type after the change is executed using the target equipment. Time may be remembered.

The schedule storage unit 145 stores the production schedule generated by the schedule generation unit 158. When the schedule generation unit 158 determines that the lot processing determination unit 157 starts the lot processing, the schedule generation unit 158 generates a production schedule using the data stored in the schedule master storage unit 144, and schedules the generated production schedule. It is stored in the storage unit 145.

The simulation time setting unit 152 of the CPU 150 sets the simulation time for executing the simulation. At the simulation time, the lot processing determination unit 157 determines whether or not to start the lot processing. In the present embodiment, the simulation time setting unit 152 sets the simulation time to the current simulation in the "scheduled arrival time of the job to the equipment (process)" and the "end time of processing for the job in the equipment (process)". Update to the earliest time after the time.

In other words, the equipment to be simulated depends on the equipment to which the job arrives, and moves to the equipment that can be simulated fastest. For example, the job P1 may arrive at the equipment Q1 at the same 10 o'clock, and the job P2 may arrive at the equipment Q2. In this case, after the simulation is executed in the equipment Q1 with the simulation time set to 10 o'clock, the simulation time is updated and the simulation is executed in the equipment Q2 at the same 10 o'clock. In this way, the simulation time may be updated at the same time.

The simulation time setting unit 152 acquires the earliest arrival time from the job information storage unit 143 as the “scheduled arrival time of the job to the equipment”. The simulation time setting unit 152 acquires the “end time of processing for the job in the equipment” from the schedule storage unit 145. The simulation time setting unit 152 arranges the acquired "estimated time of arrival of the job to the equipment" and the "end time of processing for the job in the equipment" in chronological order, and updates the simulation time at the earliest time. When the simulation time is decided, the equipment is also decided. Therefore, the simulation is performed in the facility. That is, it is determined whether or not to start processing lots in the equipment.

The simulation time setting unit 152 further determines whether or not to update the simulation time by using a predetermined end condition. When the simulation time is updated, the simulation continues, and if the simulation time is not updated, the simulation ends. When the processing start of all the job numbers stored in the job information storage unit 143 is confirmed in all the steps, the simulation time setting unit 152 determines that the first end condition is satisfied. When the simulation time Ts exceeds a predetermined time (for example, 24 hours after the start of the simulation), the simulation time setting unit 152 determines that the second end condition is satisfied.

When it is determined that at least one of the first end condition and the second end condition is satisfied, the simulation time setting unit 152 determines that the simulation time is not updated. When the simulation time setting unit 152 determines that both the first end condition and the second end condition are not satisfied, it determines that the simulation time is updated.

The earliest arrival time calculation unit 153 calculates the earliest arrival time. As described above, when the simulation time is determined, the equipment to be simulated is also determined. The earliest arrival time calculation unit 153 acquires the job number processed by the determined equipment to be simulated from the plan target data storage unit 141. The earliest arrival time calculation unit 153 acquires the equipment (process) in which each acquired job number is currently processed from the schedule storage unit 145. The earliest arrival time calculation unit 153 acquires from the planning target data storage unit 141 the passing process that passes from the equipment (process) in which each job number is currently processed until it arrives at the equipment to be simulated. The earliest arrival time calculation unit 153 acquires the acquired processing time in the passing process from the schedule master storage unit 144.

The earliest arrival time calculation unit 153 adds the total processing time in the passing process from the equipment currently being processed to the equipment to be simulated to the current simulation time for each job number, and is the earliest. Calculate the arrival time. The earliest arrival time calculation unit 153 stores the calculated earliest arrival time in the job information storage unit 143 in association with the job number and the equipment to be simulated.

When the simulation time is later than the earliest arrival time stored in the job information storage unit 143, the earliest arrival time calculation unit 153 sets the earliest arrival time stored in the job information storage unit 143 as the equipment for which the job is simulated. It may be rewritten to the arrival time when it actually arrived.

In the present embodiment, it is assumed that the transport time for transporting the job from the facility to the facility is zero, but the transfer time is not limited to this. The transport time may be set as a work standard or may be set based on past actual data. The transport time may be stored in the schedule master storage unit 144, or may be stored in association with the passing process of the plan target data storage unit 141.

The earliest lot completion time calculation unit 154 is included in the lot condition classification (set of job numbers that are lot candidates for each type of processing condition) corresponding to the equipment to be simulated and the lot condition classification from the job information storage unit 143. Get each earliest arrival time corresponding to each job number. The earliest lot completion time calculation unit 154 acquires each minimum number set for each type of processing condition corresponding to the equipment to be simulated from the lot condition storage unit 142. If there is a job that has arrived at the equipment to be simulated among the job numbers included in the lot condition classification, the lot completion time calculation unit 154 acquires the arrival time from the schedule storage unit 145. The earliest lot completion time calculation unit 154 sets the earliest arrival time of the minimum number including the arrived jobs, if any, for each type of processing condition corresponding to the equipment to be simulated, and the earliest lot completion time. Calculate as.

The lot waiting limit time calculation unit 155 acquires the maximum waiting time for each type of processing condition corresponding to the equipment to be simulated from the lot condition storage unit 142. The lot waiting limit time calculation unit 155 is included in the lot condition classification (set of job numbers that are lot candidates for each type of processing condition) corresponding to the equipment to be simulated and the lot condition classification from the job information storage unit 143. Get each earliest arrival time corresponding to each job number.

The lot waiting limit time calculation unit 155 requests from the schedule storage unit 145 the earliest job that has arrived at the equipment to be simulated among the jobs included in the lot condition classification for each type of processing condition. Get the arrival time. The lot waiting limit time calculation unit 155 calculates the time after the maximum waiting time from the acquired arrival time as the lot waiting limit time for each type of processing condition. The lot waiting limit time calculation unit 155 calculates the time after the maximum waiting time from the earliest arrival time as the lot waiting limit time if there is no job that has arrived at the equipment to be simulated for each type of processing condition. ..

The earliest lot start time calculation unit 156 calculates the earliest lot start time, which is the time at which the processing of the jobs included in the lot can be started earliest for each type of processing condition. The earliest lot start time calculation unit 156 compares the earliest lot completion time calculated by the earliest lot completion time calculation unit 154 with the lot wait limit time calculated by the lot wait limit time calculation unit 155. When the earliest lot start time calculation unit 156 is not later than the lot waiting limit time, the earliest lot start time calculation unit 156 calculates the earliest lot start time as the earliest lot start time. As a result, the jobs are processed as a lot with the minimum number of jobs.

When the earliest lot start time calculation unit 156 is later than the lot waiting limit time, the earliest lot start time calculation unit 156 extracts the latest arrival job, which is the latest arrival job among the jobs whose earliest arrival time is earlier than the lot waiting limit time. Then, the earliest arrival time of this latest arrival job is calculated as the earliest lot start time. As a result, even if the minimum number of jobs is not prepared, the jobs are processed as a lot in which as many jobs as possible are prepared by waiting until just before the lot waiting limit time.

The lot processing determination unit 157 determines whether or not to start processing the jobs included in the lot. The lot processing determination unit 157 determines that the processing of the job corresponding to the earliest lot start time is started when the earliest lot start time is earlier than or the same as the simulation time. The lot processing determination unit 157 determines that the job processing is not started when the lot start time is later than the simulation time.

The schedule generation unit 158 acquires information such as lot condition classification determined to start processing of jobs included in the lot from the lot processing determination unit 157. The schedule generation unit 158 determines the lot to start processing the job from the acquired information. The schedule generation unit 158 acquires the processing time corresponding to the types of equipment and processing conditions included in the acquired lot condition classification from the schedule master storage unit 144. The schedule generation unit 158 generates the production schedule of the jobs included in the lot condition classification according to the acquired processing time. The schedule generation unit 158 stores the generated production schedule in the schedule storage unit 145.

(Outline of operation)
Next, an outline of the operation of the simulation apparatus will be described with reference to the drawings. First, an outline of the operation of the simulation apparatus using the technique described in Patent Document 1 will be described, and then an outline of the operation of the simulation apparatus according to the first embodiment will be described. As will be described later, the operation of the simulation apparatus using the technique described in Patent Document 1 is used in the second embodiment.

In the first embodiment, as described above, when the earliest lot completion time is later than the lot waiting limit time, the earliest lot start time calculation unit 156 arrives the latest among the jobs whose earliest arrival time is earlier than the lot waiting limit time. A job is extracted, and the earliest arrival time of this latest arrival job is calculated as the earliest lot start time. Then, the lot processing determination unit 157 determines that the processing of the job included in the lot is started when the lot start time is earlier than or the same as the simulation time.

On the other hand, in the technique described in Patent Document 1, when it is found that the lot completion time is later than the lot waiting limit time, even if only one job arrives, the job included in the lot is processed. Is determined to start.

In the following description, for convenience, the processing time stored in the schedule master storage unit 144 is uniformly set to 1 hour, and the transport time for transporting the job from the facility to the facility is zero.

(Outline of operation of Patent Document 1)
2 to 5 are timing charts schematically showing an example of job movement at each simulation time. The determination of lot processing at each simulation time will be described with reference to FIGS. 2 to 5.

2 to 5 show an example in which processing is performed on a job in equipment A under two types of processing conditions, processing condition A1 and processing condition A2. The minimum number in the processing condition A1 is 4, and the maximum waiting time is 6 hours. The minimum number in the processing condition A2 is 3, and the maximum waiting time is 6 hours.

2 to 5 show the earliest arrival time or the actual arrival time of jobs J1 to J5 to the equipment A at each simulation time Ts. The star next to the time indicates that the time is the earliest arrival time for each job. The unmarked time represents the time when the job actually arrived at the facility A.

In FIG. 2, the simulation time Ts is 10 o'clock when the job J1 arrives at the equipment A. The processing condition A1 cannot be processed because there is no job that has arrived at the simulation time Ts (10 o'clock). Under the processing condition A2, the lot waiting limit time Tw is 16:00 after the maximum waiting time (6 hours) at 10 o'clock when the job J1 arrives. On the other hand, the earliest arrival time of jobs J3 and J4 is 12:00. Therefore, the lot completion time Tc is already 12 o'clock, and there is a possibility that the minimum number (3) jobs required for the lot will be completed by the lot waiting limit time Tw. Therefore, when the simulation time Ts is 10 o'clock, it is determined that the processing of the job J1 is not started.

From the above, when the simulation time Ts is 10 o'clock, the lot processing determination unit 157 determines that the processing of the jobs included in the lot is not started.

In FIG. 3, the simulation time Ts is 11 o'clock when the job J2 arrives at the equipment A. Under the processing condition A1, the lot waiting limit time Tw is 17:00 after the maximum waiting time (6 hours) at 11:00 when the job J2 arrives. Only job J5, which has an earliest arrival time of 15:00, may arrive by 17:00, which is the lot waiting limit time Tw. Therefore, there is no possibility that the minimum number of four processing conditions A1 will be aligned during the maximum waiting time of job J2 (that is, until the lot waiting limit time Tw). Therefore, it is determined that the process can be started by one of the jobs J2. This point is different from the operation of the simulation apparatus in the first embodiment described later.

On the other hand, under the processing condition A2, as described with reference to FIG. 2, the minimum number (3) of jobs required for the lot can be arranged during the maximum waiting time of job J1 (that is, until the lot waiting limit time Tw). There is sex. Therefore, when the simulation time Ts is 11 o'clock, it is determined that the processing is not started.

From the above, when the simulation time Ts is 11 o'clock, the lot processing determination unit 157 determines that the processing of the job J2 is started as a lot under the processing condition A1. The schedule generation unit 158 generates a production schedule that starts the processing of job J2 at 11:00. Therefore, as shown in the “Gantt chart of equipment A” of FIG. 3, the task of processing job J2 starts at 11 o'clock and ends at 12 o'clock. In the present embodiment, as described above, the processing time is uniformly 1 hour.

In FIG. 4, the simulation time Ts is 12 o'clock when the task of processing job J2 is completed. Note that 12 o'clock is also the time when jobs J3 and J4 arrive at facility A. The processing condition A1 cannot be processed because there is no job that has arrived when the simulation time Ts is 12 o'clock. Since the processing condition A2 has three jobs, which is the minimum number required for the lot, processing can be performed at 12 o'clock of the simulation time Ts.

From the above, when the simulation time Ts is 12 o'clock, the lot processing determination unit 157 determines that the processing of jobs J1, J3, and J4 is started as a lot under the processing condition A2. The schedule generation unit 158 generates a production schedule including a setup change time (2 hours in FIG. 4) for changing the processing condition of the equipment A from the processing condition A1 to the processing condition A2. The schedule generation unit 158 generates a production schedule that starts the processing of jobs J1, J3, and J4 at 14:00 and ends at 17:00 after the setup change time ends. Therefore, as shown in the “Gantt chart of equipment A” of FIG. 4, the task of sequentially processing jobs J1, J3, and J4 starts at 14:00 and ends at 17:00.

In FIG. 5, the simulation time Ts is 17:00 when the task of processing job J4 is completed. Under the processing condition A1, the lot waiting limit time Tw is 21:00 after the maximum waiting time (6 hours) at 15:00 when the job J5 arrives. There is no possibility that the minimum number will be available by 21:00, which is the lot waiting limit time Tw. Therefore, at 17:00, which is the simulation time Ts, it is determined that the processing condition A1 starts processing with one of the jobs J5. On the other hand, the processing condition A2 cannot be processed because there is no job that has arrived when the simulation time Ts is 17:00.

From the above, when the simulation time Ts is 17:00, the lot processing determination unit 157 determines that the processing of the job J5 is started as a lot under the processing condition A1. The schedule generation unit 158 generates a production schedule including a setup change time (2 hours in FIG. 5) for changing the processing condition of the equipment A from the processing condition A2 to the processing condition A1. The schedule generation unit 158 generates a production schedule that starts processing of job J5 at 19:00 after the setup change time ends. Therefore, as shown in the “Gantt chart of equipment A” of FIG. 5, the task of processing job J5 starts at 19:00 and ends at 20:00.

In the operation of FIG. 3, it is found that when the simulation time Ts is 11 o'clock, the minimum number of jobs is not prepared by the lot waiting limit time Tw under the processing condition A1. Therefore, as shown in FIG. 3, the process of job J2 is started at the time when this is found. This makes it possible to process the job J2 without waiting until the lot waiting limit time Tw.

However, under the processing condition A1, since the lot is processed by only one job J2, there is a possibility that the setup change time is increased. For example, there is a possibility that job J2 and job J5 can be aggregated. Focusing on this point is the simulation device of the first embodiment.

(Updated arrival time)
Before the outline of the operation of the simulation apparatus according to the first embodiment is explained, the update of the arrival time is explained. The update of the earliest arrival time is the same in the operation of the simulation device using the technique described in Patent Document 1 and the operation of the simulation device in the first embodiment described later.

FIG. 6 is a timing chart showing the earliest arrival time before the start of lot processing is determined at the simulation time. FIG. 7 is a timing chart showing the earliest arrival time updated after the start of lot processing is determined at the same simulation time as in FIG. The update of the earliest arrival time will be described with reference to FIGS. 6 and 7.

6 and 7 show an example in which jobs J1 to J5 are processed by the equipment A and then processed by the equipment B. That is, the process of equipment B is the next process of the process of equipment A. In addition, also in FIGS. 6 and 7, the processing time of each job (that is, the execution time of the task) is set to 1 hour, and the transport time from the equipment A to the equipment B is set to zero, as in FIGS. Has been done.

In FIG. 6, the simulation time Ts is 14:00, and jobs J1 and J2 are already assigned to the equipment A. That is, the production schedule of jobs J1 and J2 in the equipment A is fixed. Therefore, the estimated time of arrival at facility B, which is the next process of jobs J1 and J2, is also fixed. That is, the estimated time of arrival of job J1 at equipment B is 13:00 when the processing of job J1 ends at equipment A, and the estimated time of arrival of job J2 at equipment B ends the processing of job J2 at equipment A. It's 14:00.

On the other hand, jobs J3, J4 and J5 have not yet been assigned to equipment A. That is, the production schedule of jobs J3, J4, and J5 in the facility A has not been finalized. Jobs J3 and J4 have already arrived at facility A at 13:00. Job J5 has the earliest arrival time at 15:00 and has not yet arrived at facility A.

The earliest arrival time is assumed to be undisturbed by other jobs, as described above. Therefore, the earliest arrival times of jobs J3 and J4 to equipment B are calculated on the assumption that the processing of job J2 is started at 14:00 when the processing of job J2 is completed. Therefore, the earliest arrival time of jobs J3 and J4 at facility B is 15:00. Further, the earliest arrival time of the job J5 to the equipment B is calculated on the assumption that the processing at the equipment A is started at 15:00 when the job J5 arrives at the equipment A. Therefore, the earliest arrival time of job J5 at facility B is 16:00.

In the state of FIG. 6, it is determined that the processing of jobs J3 and J4 included in the lot is started at 14:00 of the simulation time Ts. In the example of FIG. 7, the schedules are assigned in the order of job J3-job J4. As a result, the estimated time of arrival of jobs J3 and J4 at facility B is fixed. As shown in FIG. 7, the earliest arrival time of job J3 to equipment B remains unchanged at 15:00, but the earliest arrival time of job J4 to equipment B is updated from 15:00 to 16:00.

Further, the processing start time of the job J5 in the equipment A was 16:00, when the processing of the job J4 was completed at the earliest, which was extended from 15:00. Therefore, the estimated time of arrival of job J5 at equipment B has not been determined, but the earliest arrival time has been updated from 16:00 to 17:00.

(Characteristics of operation of the first embodiment)
FIG. 8 is a timing chart for explaining the characteristics of the operation of the first embodiment. The features of the simulation apparatus according to the first embodiment will be described with reference to FIG.

FIG. 8 shows an example in which processing for a job is performed under the processing condition X1 in the equipment X. The minimum number under the processing condition X1 is 5, and the maximum waiting time is 7 hours.

FIG. 8 shows the earliest arrival time or the actual arrival time of jobs J1 to J5 to the equipment X at each simulation time Ts. Similar to FIGS. 2 to 5, the star mark next to the time indicates that the time is the earliest arrival time of each job. The unmarked time represents the time when the job actually arrived at the equipment X.

In FIG. 8, the simulation time Ts is 10 o'clock, the job J1 has already arrived at the equipment X at 8 o'clock, and the jobs J2 to J5 are scheduled to arrive at the equipment X in the future. Since the minimum number of processing conditions X1 is 5, the earliest arrival time of jobs J4 and J5, 16:00, is the earliest lot completion time Tc. Further, the lot waiting limit time Tw is 15:00 after the maximum waiting time (7 hours) from the arrival time of job J1 at 8:00. Therefore, since the lot waiting limit time Tw is earlier than the lot completion time Tc, it is known that the minimum number of jobs is not prepared by the lot waiting limit time Tw at the time of the simulation time Ts.

In the technique described in Patent Document 1, as shown in FIG. 3, it is determined that the processing of the job included in the lot is started when it is found that the minimum number of lots is not prepared by the lot waiting limit time Tw. Was there. On the other hand, in the simulation apparatus of the first embodiment, even if it is found that the minimum number of lots is not prepared by the lot waiting limit time Tw, it will arrive in the future by the lot waiting limit time Tw under the same processing conditions. If there is a scheduled job, the restriction that the processing of the job included in the lot is not started is added. That is, it is known that the minimum number is not prepared when the job J1 arrives at 8 o'clock, but it is not determined that the processing of the job J1 is started.

Further, among the jobs scheduled to arrive in the future by the lot waiting limit time Tw, the earliest arrival time of the latest arrival job (job J3 in FIG. 8) having the latest arrival time is set as the earliest lot start time Tp. As described above, since the earliest arrival time of the job is updated, this earliest lot start time Tp is updated for each simulation time. Then, when the earliest lot start time Tp is the same as the simulation time Ts or earlier than the simulation time Ts, it is determined that the processing of the job included in the lot of the processing condition is started.

In the example of FIG. 8, the maximum number of jobs scheduled to arrive by 15:00, which is the lot waiting limit time Tw after the maximum waiting time (7 hours) of job J1 arriving at 8 o'clock, is 3 jobs J1, J2, J3. Is. Therefore, the processing of the processing condition X1 is started before the five jobs, which is the minimum number of lots, are prepared. At this time, in the first embodiment, among the jobs scheduled to arrive by 15:00, which is the lot waiting limit time Tw, 13:00, which is the earliest arrival time of the latest arrival job J3, is the earliest lot start time. It is said to be Tp. As a result, it is not determined that the processing of the job included in the lot of the processing condition X1 is started until 13:00, which is the earliest lot start time Tp.

(Outline of operation of the first embodiment)
9 to 12 are timing charts schematically showing an example of job movement at each simulation time in the first embodiment. The determination of lot processing at each simulation time in the first embodiment will be described with reference to FIGS. 9 to 12.

In FIGS. 9 to 12, similarly to FIGS. 2 to 5, in the equipment A, processing is performed on the job under two types of processing conditions, processing condition A1 and processing condition A2. Is shown. The minimum number in the processing condition A1 is 4, and the maximum waiting time is 6 hours. The minimum number in the processing condition A2 is 3, and the maximum waiting time is 6 hours.

9 to 12 show the earliest arrival time or the actual arrival time of jobs J1 to J5 to the equipment A at each simulation time Ts, as in FIGS. 2 to 5. The star next to the time indicates that the time is the earliest arrival time for each job. The unmarked time represents the time when the job actually arrived at the facility A.

In FIG. 9, the simulation time Ts is 10 o'clock when the job J1 arrives at the equipment A. The processing condition A1 cannot be processed because there is no job that has arrived at the simulation time Ts (10 o'clock). Under the processing condition A2, the lot waiting limit time Tw is 16:00 after the maximum waiting time (6 hours) at 10 o'clock when the job J1 arrives. On the other hand, the earliest arrival time of jobs J3 and J4 is 12:00. Therefore, the lot completion time Tc is already 12 o'clock, and there is a possibility that the minimum number (3) jobs required for the lot will be completed by the lot waiting limit time Tw. Therefore, when the simulation time Ts is 10 o'clock, it is determined that the processing of the job J1 is not started.

From the above, when the simulation time Ts is 10 o'clock, the lot processing determination unit 157 determines that the processing of the jobs included in the lot is not started.

In FIG. 10, the simulation time Ts is 11 o'clock when the job J2 arrives at the equipment A. Under the processing condition A1, the lot waiting limit time Tw is 17:00 after the maximum waiting time (6 hours) at 11:00 when the job J2 arrives. Only job J5 may arrive by 17:00, which is the lot waiting time limit Tw. That is, job J5 is the latest arrival job. Therefore, the earliest lot start time calculation unit 156 calculates the earliest arrival time of job J5, 15:00, as the earliest lot start time Tp. Therefore, when the simulation time Ts is 11 o'clock, it is determined that the processing under the processing condition A1 is not started.

On the other hand, under the processing condition A2, as described with reference to FIG. 9, the minimum number (3) required for the lot is set at the earliest lot completion time Tc, which is during the maximum waiting time of job J1 (that is, until the lot waiting limit time Tw). There is a possibility that (pieces) jobs will be available. Therefore, when the simulation time Ts is 11 o'clock, it is determined that the processing under the processing condition A2 is not started.

From the above, when the simulation time Ts is 11 o'clock, the lot processing determination unit 157 determines that the processing of the job J2 is not started under the processing condition A1 as a lot.

In FIG. 11, the simulation time Ts is 12 o'clock when the jobs J3 and J4 arrive at the equipment A. In the processing condition A1, since the lot start time Tp is 15:00, it is determined that the processing of the jobs included in the lot is not started when the simulation time Ts is 12:00. Since the processing condition A2 includes three jobs, which is the minimum number required for the lot, it is possible to process the jobs included in the lot at 12 o'clock of the simulation time Ts.

From the above, when the simulation time Ts is 12 o'clock, the lot processing determination unit 157 determines that the processing of jobs J1, J3, and J4 is started as a lot under the processing condition A2. The schedule generation unit 158 generates a production schedule that starts the processing of jobs J1, J3, and J4 at 12:00 and ends at 15:00. Therefore, as shown in the “Gantt chart of equipment A” of FIG. 11, the task of processing jobs J1, J3, and J4 starts at 12:00 and ends at 15:00.

In FIG. 12, the simulation time Ts is 15:00 when the task of processing job J4 is completed. Note that 15:00 is also the time when job J5 arrives at equipment A. In the processing condition A1, the simulation time Ts coincides with the lot start time Tp at the earliest. Therefore, it is determined that the processing of jobs J2 and J5 is started at 15:00, which is the simulation time Ts. The processing condition A2 cannot be processed because there is no job that has arrived.

From the above, when the simulation time Ts is 15:00, the lot processing determination unit 157 determines that the processing of jobs J2 and J5 is started as a lot under the processing condition A1. The schedule generation unit 158 generates a production schedule including a setup change time (2 hours in FIG. 12) for changing the processing condition of the equipment A from the processing condition A2 to the processing condition A1. The schedule generation unit 158 generates a production schedule that starts the processing of jobs J2 and J5 at 17:00 and ends at 19:00 after the setup change time ends. Therefore, as shown in the “Gantt chart of equipment A” of FIG. 12, the task of processing jobs J2 and J5 starts at 17:00 and ends at 19:00.

(Operation procedure of the first embodiment)
13 and 14 are flowcharts schematically showing an example of the operation procedure of the simulation apparatus according to the first embodiment.

In step S1300 of FIG. 13, the CPU 150 reads data from the plan target data storage unit 141 and stores it in the RAM of the memory 130. In step S1310, the CPU 150 reads the lot condition from the lot condition storage unit 142 and stores it in the RAM of the memory 130. In step S1320, the job classification unit 151 generates a lot condition classification and stores it in the job information storage unit 143.

In step S1330, the simulation time setting unit 152 initializes the simulation time Ts. The simulation time setting unit 152 may set the simulation time Ts to, for example, "0:00". In this case, the user may select the equipment to be simulated. Alternatively, the simulation time setting unit 152 may set the simulation time Ts to, for example, the processing end time of the last task in the fixed production schedule stored in the schedule storage unit 145. In this case, the equipment to be simulated is the equipment for which the last task has been processed.

In step S1340, the earliest arrival time calculation unit 153 acquires unprocessed jobs at the time of simulation time Ts from the lot condition classification of the job information storage unit 143 in the equipment to be simulated, and each equipment (each process) of each job. ) Is calculated as the earliest arrival time. The earliest arrival time calculation unit 153 stores the calculated earliest arrival time in the job information storage unit 143.

In step S1350, the earliest lot completion time calculation unit 154 stores the earliest arrival time calculated by the earliest arrival time calculation unit 153 and stored in the job information storage unit 143 in the equipment to be simulated and stored in the lot condition storage unit 142. The earliest lot completion time is calculated using the minimum number of pieces.

In step S1360, the lot waiting limit time calculation unit 155 arrives at the earliest arrival time of the job that arrives at the equipment to be simulated earliest among each job (or the job that has arrived at the equipment to be simulated earliest). The lot waiting limit time is calculated by using the job arrival time) and the maximum waiting time stored in the lot condition storage unit 142.

In step S1370, the earliest lot start time calculation unit 156 has the earliest lot completion time calculated by the earliest lot completion time calculation unit 154 in the equipment to be simulated, and the lot wait limit time calculation unit 155 has calculated the earliest lot completion time. Determine if it is later than the time. If the earliest lot completion time is earlier than the lot waiting limit time or the same as the lot waiting limit time (NO in step S1370), the process proceeds to step S1380. On the other hand, if the lot completion time is later than the lot waiting limit time (YES in step S1370), the process proceeds to step S1390.

In step S1380, the earliest lot start time calculation unit 156 calculates the earliest lot completion time as the earliest lot start time. In step S1390, the earliest lot start time calculation unit 156 sets the earliest arrival time of the latest arrival job (as described above, the job whose earliest arrival time is earlier than the lot waiting limit time and arrives later). Calculated as the lot start time.

In step S1400 of FIG. 14, the lot processing determination unit 157 determines whether or not the simulation time Ts is earlier than the earliest lot start time. When the simulation time Ts is earlier than the lot start time (YES in step S1400), the lot processing determination unit 157 determines that the processing of the jobs included in the lot is not started, and the processing proceeds to step S1430. On the other hand, when the simulation time Ts is later than or at the same time as the lot start time (NO in step S1400), the lot processing determination unit 157 determines that the processing of the job included in the lot is started, and the processing proceeds to step S1410. ..

In step S1410, the schedule generation unit 158 determines the lot to start processing. In step S1420, the schedule generation unit 158 updates the production schedule based on the lot that starts the determined process.

In step S1430, the simulation time setting unit 152 determines whether or not the end condition is satisfied. If the simulation time setting unit 152 determines that both the first end condition and the second end condition are not satisfied (NO in step S1430), the process proceeds to step S1440. On the other hand, when the simulation time setting unit 152 determines that at least one of the first end condition and the second end condition is satisfied (YES in step S1430), the operations of FIGS. 13 and 14 end.

In step S1440, the simulation time setting unit 152 updates the simulation time. After that, the process returns to step S1340, and the above steps are repeated.

(Effect of the first embodiment)
As described above, in the first embodiment, the earliest lot start time calculation unit 156 extracts the latest arrival job when the earliest lot completion time is later than the lot waiting limit time, and this latest arrival job. The earliest arrival time of is calculated as the earliest lot start time. Therefore, according to the first embodiment, even if the minimum number of jobs is not prepared, the jobs can be processed as a lot in which as many jobs as possible are prepared.

(Second Embodiment)
In the second embodiment, the technique described in Patent Document 1 in which it is determined that the processing of the job included in the lot is started when the lot completion time is found to be later than the lot waiting limit time, and the lot is the earliest lot completion time. When it is later than the waiting limit time, the first embodiment in which it is determined that the processing of the job included in the lot is started at the earliest arrival time of the latest arrival job among the jobs whose earliest arrival time is earlier than the lot waiting limit time. Switching is done according to the situation.

(Structure of the second embodiment)
FIG. 15 is a block diagram schematically showing an example of the configuration of the simulation device 100A according to the second embodiment. As shown in FIG. 15, the simulation device 100A in the second embodiment includes a display 110, an input unit 120, a memory 130A, a storage device 140A, and a CPU 150A.

The memory 130A is composed of, for example, a semiconductor memory or the like. The memory 130A includes, for example, ROM, RAM, EEPROM and the like. The ROM of the memory 130A stores the control program of the second embodiment for operating the CPU 150A.

By operating according to the control program of the second embodiment stored in the memory 130A, the CPU 150A has a job classification unit 151, a simulation time setting unit 152, an earliest arrival time calculation unit 153, an earliest lot completion time calculation unit 154, and a lot. It has the functions of the waiting limit time calculation unit 155, the earliest lot start time calculation unit 156A, the lot processing determination unit 157, the schedule generation unit 158, and the total waiting time calculation unit 159.

The storage device 140A is composed of, for example, a hard disk, a semiconductor memory, or the like. The storage device 140 includes a plan target data storage unit 141, a lot condition storage unit 142A, a job information storage unit 143, a schedule master storage unit 144, and a schedule storage unit 145. Each storage unit 141 to 145 may be composed of different media from each other. Alternatively, each storage unit 141 to 145 may be composed of one medium in which the storage area is divided.

The lot condition storage unit 142A of the second embodiment stores a predetermined reference waiting time in addition to the data stored by the lot condition storage unit 142 (FIG. 1) of the first embodiment. The reference waiting time will be described later.

The total waiting time calculation unit 159 calculates the total waiting time when the processing of the jobs included in the lot is started at the earliest arrival time of the latest arrival job when the earliest lot completion time is later than the lot waiting limit time. As described above, the latest arrival job is the job whose earliest arrival time is earlier than the lot waiting limit time and which arrives the latest.

That is, the total waiting time calculation unit 159 has the earliest arrival time of the unprocessed job included in the lot candidate and the lot, which are stored in the job information storage unit 143 for each type of processing condition in the equipment to be simulated. Compare with the lot waiting limit time calculated by the waiting limit time calculation unit 155, and acquire the unprocessed jobs included in the lot candidates that arrive by the lot waiting limit time. The unprocessed jobs acquired by the total waiting time calculation unit 159 include jobs that have already arrived at the equipment to be simulated. The total waiting time calculation unit 159 extracts the latest arrival job from the earliest arrival time of the acquired job. The total waiting time calculation unit 159 calculates the sum of the waiting times of all jobs when the job processing is started at the earliest arrival time of the latest arrival job as the total waiting time.

When the earliest lot start time calculation unit 156A has the earliest lot completion time later than the lot wait limit time, the reference waiting time stored in the lot condition storage unit 142A and the total waiting time calculated by the total waiting time calculation unit 159 Compare with time. When the reference waiting time is equal to or greater than the total waiting time, the earliest lot start time calculation unit 156A calculates the earliest arrival time of the latest arrival job as the earliest lot start time. That is, the operation of the first embodiment is performed. On the other hand, when the reference waiting time is less than the total waiting time and there is a job that has arrived at the equipment to be simulated, the earliest lot start time calculation unit 156A calculates the current simulation time Ts as the earliest lot start time. To do.

(Outline of operation of the second embodiment)
FIG. 16 is a timing chart for explaining the outline of the operation of the second embodiment. FIG. 16 shows a first case and a second case in which the magnitude relationship between the reference waiting time and the total waiting time is different from each other. In both the first case and the second case, the job is processed in the equipment X under the processing condition X1. The minimum number of pieces in the processing condition X1 is 5, the reference waiting time is 10 hours, and the maximum waiting time is 8 hours.

In the first case and the second case, the simulation time Ts is the same 10 o'clock, and the number of jobs processed by the equipment X is also the same for the four jobs J1 to J4. The simulation time Ts (10 o'clock) in FIG. 16 may be, for example, the end time of the process executed in the equipment X.

FIG. 16 shows the earliest arrival time or the actual arrival time of the jobs J1 to J4 to the equipment X at the simulation time Ts, as in the case of FIG. 9 and the like. The star next to the time indicates that the time is the earliest arrival time for each job. The unmarked time represents the time when the job actually arrived at the equipment X.

In the first case, the job J1 has already arrived at 8 o'clock, and the lot waiting limit time Tw after the maximum waiting time (8 hours) is 16:00. In the second case as well, the jobs J1 and J2 have arrived at 8 o'clock, and the lot waiting limit time Tw after the maximum waiting time (8 hours) is 16:00 as in the first case. Further, among the jobs whose earliest arrival time is earlier than 16:00, which is the lot waiting limit time Tw, the earliest arrival time of the latest arrival job (job J4 in FIG. 16) is the first case and the second case. Both of them are at 14:00. In both the first case and the second case, it was found that at 10 o'clock, which is the simulation time Ts, the minimum number of 5 jobs was not completed by 16:00, which is the lot waiting limit time Tw. There is.

In the first case, when the processing of the jobs included in the lot is started at the earliest arrival time (14:00) of the latest arrival job (job J4), the total waiting time, which is the sum of the waiting times of each job, is
6 hours (J1) + 1 hour (J2) + 1 hour (J3) + 0 hours (J4)
= 8 hours. Since the reference waiting time is 10 hours, the total waiting time ≤ the reference waiting time. Therefore, the earliest lot start time calculation unit 156A calculates the earliest arrival time of the latest arrival job (job J4) at 14:00 as the earliest lot start time. That is, the operation of the first embodiment is performed.

In the second case, when the processing of the jobs included in the lot is started at the earliest arrival time (14:00) of the latest arrival job (job J4), the total waiting time, which is the sum of the waiting times of each job, is
6 hours (J1) + 6 hours (J2) + 1 hour (J3) + 0 hours (J4)
= 13 hours. Since the reference waiting time is 10 hours, the total waiting time> the reference waiting time. Therefore, the earliest lot start time calculation unit 156A calculates the current simulation time Ts of 10 o'clock as the earliest lot start time. That is, the same operation as the technique described in Patent Document 1 is performed.

(Operation procedure of the second embodiment)
17 and 18 are flowcharts schematically showing an example of the operation procedure of the simulation apparatus according to the second embodiment. Steps S1300 to S1360 in FIG. 17 are the same as steps S1300 to S1360 in FIG.

In step S1370, the earliest lot start time calculation unit 156A has the earliest lot completion time calculated by the earliest lot completion time calculation unit 154 in the equipment to be simulated, and the lot wait limit time calculation unit 155 calculated by the lot wait limit time calculation unit 155. Determine if it is later than the time. If the earliest lot completion time is earlier than the lot waiting limit time or the same as the lot waiting limit time (NO in step S1370), the process proceeds to step S1380. On the other hand, if the lot completion time is later than the lot waiting limit time (YES in step S1370), the process proceeds to step S1700. In step S1380, the earliest lot start time calculation unit 156A calculates the earliest lot completion time as the earliest lot start time. After that, the process proceeds to step S1400.

In step S1700, the total waiting time calculation unit 159 calculates the sum of the waiting times of all the jobs as the total waiting time when the processing of the jobs included in the lot is started at the earliest lot start time of the latest arrival job. .. In step S1710, the earliest lot start time calculation unit 156A compares the reference waiting time stored in the lot condition storage unit 142A with the total waiting time calculated by the total waiting time calculation unit 159.

In step S1720, the earliest lot start time calculation unit 156A calculates the earliest lot start time based on the comparison result. That is, when the reference waiting time is equal to or greater than the total waiting time, the earliest lot start time calculation unit 156A calculates the earliest arrival time of the latest arrival job as the earliest lot start time. On the other hand, when the reference waiting time is less than the total waiting time and there is a job that has arrived, the earliest lot start time calculation unit 156A calculates the current simulation time Ts as the earliest lot start time. After that, the process proceeds to step S1400. Steps S1400 to S1440 of FIG. 18 are the same as steps S1400 to S1440 of FIG.

(Effect of the second embodiment)
As described above, in the second embodiment, when the earliest lot completion time is later than the lot waiting limit time, the processing of the jobs included in the lot is started at the earliest lot start time of the latest arrival job. The sum of the waiting times of all jobs is calculated as the total waiting time. When the reference waiting time is equal to or greater than the total waiting time, the earliest arrival time of the latest arrival job is calculated as the earliest lot start time. On the other hand, when the reference waiting time is less than the total waiting time and there is a job that has arrived, the current simulation time Ts, that is, the current simulation time Ts is calculated as the earliest lot start time.

The reference waiting time is set in advance for each type of equipment and processing conditions, and is stored in the lot condition storage unit 142. The user may set the reference waiting time based on past achievements, empirically, or by trial and error.

When the reference waiting time is set to a large value, the case where the total waiting time ≤ the reference waiting time increases. Therefore, lots are composed of as many jobs as possible. As a result, the setup change time is reduced, and a productivity-oriented production schedule is generated.

On the contrary, if the reference waiting time is set to a small value, the total waiting time> the reference waiting time may increase. Therefore, even if there is only one job, lot processing is started. As a result, the number of jobs waiting to be processed in the equipment (process) is reduced, so that a production schedule that emphasizes retention suppression is generated.

Therefore, in a process with a high load (that is, equipment having a long total processing time for a job), the reference waiting time may be set to a large value and a productivity-oriented production schedule may be generated. In a process with a low load (that is, equipment having a short total processing time for a job), the reference waiting time may be set to a small value to generate a production schedule that emphasizes retention suppression. As described above, according to the second embodiment, it is possible to generate a production schedule according to the characteristics of the process.

(Transformed embodiment)
(1) In each of the above embodiments, the simulation time setting unit 152 sets the simulation time in the "scheduled arrival time of the job to the equipment (process)" and the "end time of processing for the job in the equipment (process)". , It is after the current simulation time and is updated to the earliest time, but it is not limited to this. For example, the simulation time setting unit 152 may update the simulation time with a fixed time width (for example, 1 hour). In this case, the equipment to be simulated may be automatically set in a predetermined order, or may be selected by the user.

(2) In the above embodiment, in step S850 of FIG. 8, it is determined whether or not all the tasks of the equipment to be changed have been selected, but the present invention is not limited to this. In the simulation of step S1310 of FIG. 7, only the tasks whose work start time or work end time has been changed may be selected. That is, for example, in section (B) of FIG. 4, only tasks 11 to 14 may be selected. For tasks 15 to 17, since the work start time and work end time have not been changed, the deadline time for the back-end process of the front-end process task and the shortest inter-process time completion time of the back-end process task do not change, so recalculation Because there is no need to do it.

130, 130A Memory 141 Planning target data storage unit 142, 142A Lot condition storage unit 143 Job information storage unit 144 Schedule master storage unit 145 Schedule storage unit 150, 150A CPU
151 Job classification unit 152 Simulation time setting unit 153 Early arrival time calculation unit 154 Early lot completion time calculation unit 155 Lot wait limit time calculation unit 156, 156A Early lot start time calculation unit 157 Lot processing judgment unit 158 Schedule generation unit 159 Total wait Time calculation department

Claims (5)

In a production line that manufactures the plurality of types of products by processing a plurality of types of jobs in a predetermined order in a predetermined order among a plurality of processes, the processing conditions for processing the jobs in the passing process are the same. A simulation device that executes a simulation for determining whether or not to start processing the jobs included in the lot when the above jobs are collectively processed as a lot and continuously processed in the passing process.
Planned data storage in which the plurality of types of jobs, the passing process for each of the plurality of types of jobs, and the types of processing conditions for processing the plurality of types of jobs in the passing process are stored in advance. Department and
The type of the processing condition in the passing process, the minimum number of jobs constituting the lot determined to be complete, which are preset for each type of the processing condition, and the preset for each type of the processing condition. , A lot in which lot conditions including a maximum waiting time that the job can wait without being processed after the first job constituting the lot arrives in the passing process are stored in advance for each passing process. Condition storage and
Using the plurality of types of jobs and the types of the processing conditions stored in the planning target data storage unit and the types of the processing conditions included in the lot conditions stored in the lot condition storage unit, A job classification unit that classifies the plurality of types of jobs as lot candidates constituting the lot for each type of processing conditions.
A simulation time setting unit that sets the simulation time, which is the time to execute the simulation,
For each of the passing steps, for the job whose processing has not started at the simulation time, assuming that there is no waiting time for processing in all the passing steps, at the time when the job is scheduled to arrive at the passing step. The earliest arrival time calculation unit that calculates a certain earliest arrival time,
For the lot whose processing has not started at the simulation time, the job classified as the lot candidate by using the earliest arrival time and the minimum number included in the lot condition is the minimum for each lot. The earliest lot completion time calculation unit that calculates the earliest lot completion time, which is the earliest time to complete the quantity,
For the lot for which processing has not started at the simulation time, the time when the first job classified as the lot candidate arrives at the passing process and the time when the first job classified as the lot candidate arrives at the passing process are stored in the lot condition storage unit for each lot. A lot waiting limit time calculation unit that calculates the lot waiting limit time, which is the latest time that the first job can wait, using the maximum waiting time included in the lot condition.
For the lot whose processing has not started at the simulation time, the earliest lot start time calculation unit that calculates the earliest lot start time for each lot,
For the lot for which processing has not been started at the simulation time, a lot processing determination unit for determining whether or not to start processing of the job classified as the lot candidate for each lot.
With
The earliest lot start time calculation unit determines whether or not the earliest lot completion time is later than the lot waiting limit time, and if it is determined that the earliest lot completion time is not later than the lot waiting limit time, the earliest lot When the completion time is calculated as the earliest lot start time and it is determined that the earliest lot completion time is later than the lot waiting limit time, the job classified as the lot candidate arrives earlier than the lot waiting limit time. The earliest arrival time of the latest arrival job, which is the latest arrival job among the jobs, is calculated as the earliest lot start time.
When the simulation time is earlier than the earliest lot start time, the lot processing determination unit determines that the processing of the job classified as the lot candidate is not started, and when the simulation time is after the earliest lot start time. , Determines to start processing the job classified as the lot candidate,
Simulation equipment. When the earliest lot start time calculation unit determines that the earliest lot completion time is later than the lot waiting limit time, the processing of the job classified as the lot candidate at the earliest arrival time of the latest arrival job is performed. Further provided is a total waiting time calculation unit for calculating the total waiting time, which is the total waiting time until the earliest arrival time of the latest arrival job of all the jobs for which processing has been started when the processing is started. ,
The lot condition storage unit stores a predetermined reference waiting time, and stores the reference waiting time.
When the earliest lot start time calculation unit determines that the earliest lot completion time is later than the lot waiting limit time, the reference waiting time is further compared with the total waiting time, and the reference waiting time is the total waiting time. When it is more than an hour, the earliest arrival time of the latest arrival job is calculated as the earliest lot start time, and when the reference waiting time is less than the total waiting time, the simulation time is used as the earliest lot start time. calculate,
The simulation apparatus according to claim 1. The reference waiting time is set to a larger value when the total processing time of the jobs corresponding to the types of processing conditions in the passing process is longer than when it is shorter for each type of processing conditions in the passing process. Set,
The simulation apparatus according to claim 2. When the simulation time setting unit determines whether or not the lot processing determination unit starts processing the job classified as the lot candidate, the passage is calculated after the current simulation time. The earliest time among the earliest arrival time to the process and the processing end time for the job in the passing process is set to the next simulation time.
The simulation apparatus according to any one of claims 1 to 3. In a production line that manufactures the plurality of types of products by processing a plurality of types of jobs in a predetermined order in a predetermined order among a plurality of processes, the processing conditions for processing the jobs in the passing process are the same. A simulation method for executing a simulation for determining whether or not to start processing the jobs included in the lot when the above jobs are collectively processed as a lot and continuously processed in the passing process.
The simulation method is
Planned data storage in which the plurality of types of jobs, the passing process for each of the plurality of types of jobs, and the types of processing conditions for processing the plurality of types of jobs in the passing process are stored in advance. Department and
The type of the processing condition in the passing process, the minimum number of jobs constituting the lot determined to be complete, which are preset for each type of the processing condition, and the preset for each type of the processing condition. , A lot in which lot conditions including a maximum waiting time that the job can wait without being processed after the first job constituting the lot arrives in the passing process are stored in advance for each passing process. Condition storage and
Used in simulation equipment equipped with
The simulation method is
Using the plurality of types of jobs and the types of the processing conditions stored in the planning target data storage unit and the types of the processing conditions included in the lot conditions stored in the lot condition storage unit, A job classification step for classifying the plurality of types of jobs as lot candidates constituting the lot for each type of processing conditions, and
A simulation time setting step for setting the simulation time, which is the time for executing the simulation, and
For each of the passing steps, for the job whose processing has not started at the simulation time, assuming that there is no waiting time for processing in all the passing steps, at the time when the job is scheduled to arrive at the passing step. The earliest arrival time calculation step to calculate a certain earliest arrival time,
For the lot whose processing has not started at the simulation time, the job classified as the lot candidate by using the earliest arrival time and the minimum number included in the lot condition is the minimum for each lot. The earliest lot completion time calculation step to calculate the earliest lot completion time, which is the earliest time to complete the quantity,
For the lot for which processing has not started at the simulation time, the time when the first job classified as the lot candidate arrives at the passing process and the time when the first job classified as the lot candidate arrives at the passing process are stored in the lot condition storage unit for each lot. A lot waiting limit time calculation step for calculating the lot waiting limit time, which is the latest time that the first job can wait, using the maximum waiting time included in the lot condition, and
For the lot whose processing has not been started at the simulation time, the earliest lot start time calculation step for calculating the earliest lot start time for each lot, and
For the lot whose processing has not been started at the simulation time, a lot processing determination step for determining whether or not to start processing of the job classified as the lot candidate for each lot.
With
The earliest lot start time calculation step determines whether or not the earliest lot completion time is later than the lot waiting limit time, and if it is determined that the earliest lot completion time is not later than the lot waiting limit time, the earliest lot When the completion time is calculated as the earliest lot start time and it is determined that the earliest lot completion time is later than the lot waiting limit time, the job classified as the lot candidate arrives earlier than the lot waiting limit time. The earliest arrival time of the latest arrival job, which is the latest arrival job among the jobs, is calculated as the earliest lot start time.
The lot processing determination step determines that processing of the job classified as the lot candidate is not started when the simulation time is earlier than the earliest lot start time, and when the simulation time is after the earliest lot start time. , Determines to start processing the job classified as the lot candidate,
Simulation method.

Images