Job planning device and job planning method

A job planning method implemented by a computer, the job planning method comprising:

• assigning workers to a production line and assigning a job, a tool required, and/or equipment required to each worker of the workers;
• calculating depreciation per predetermined period of time in a whole of the production line based on depreciation of the tool and/or the equipment and a labor cost of the production line per the predetermined period of time based on overtime hours of the each worker calculated from a takt time of the production line and individual cycle times of the workers working in the production line;
• and
• calculating a sum of costs calculated in the calculating with respect to each assignment plan created in the assigning, and determining workers, tools, and/or equipment to be actually assigned to the production line based on the sum.

A non-transitory computer-readable storage medium storing a job planning program that causes a computer to execute a process, the process comprising:

• assigning workers to a production line and assigning a job, a tool required, and/or equipment required to each worker of the workers;
• calculating depreciation per predetermined period of time in a whole of the production line based on depreciation of the tool and/or the equipment and a labor cost of the production line per the predetermined period of time based on overtime hours of the each worker calculated from a takt time of the production line and individual cycle times of the workers working in the production line;
• and
• calculating a sum of costs calculated in the calculating with respect to each assignment plan created in the assigning, and determining workers, tools, and/or equipment to be actually assigned to the production line based on the sum.

A job planning device comprising:

• a memory;
• a processor coupled to the memory and configured to:
• receive an input of rearrangement information and planning information, the rearrangement information including a content of a change of operators, each being a person or robot, assigned to stations on an assembly line and information about jobs to be assigned to the stations, the planning information including information about jobs that have been assigned to each of the operators before rearrangement;
• calculate an evaluation value from a number of jobs each being assigned to a different operator from an operator to which the job has been assigned in the planning information based on the rearrangement information when the jobs are assigned to the operators based on the rearrangement information;
• search a job plan including a combination of jobs assigned to each of the operators by solving an optimization problem under a condition that the calculated evaluation value or a value based on the calculated evaluation value is to be minimized;
• and
• output the searched job plan.

A job planning method implemented by a computer, the job planning method comprising:

• receiving an input of rearrangement information and planning information, the rearrangement information including a content of a change of operators, each being a person or robot, assigned to stations on an assembly line and information about jobs to be assigned to the stations, the planning information including information about jobs that have been assigned to the operators before rearrangement;
• calculating an evaluation value from a number of jobs each being assigned to a different operator from an operator to which the job has been assigned in the planning information when the jobs are assigned to the operators based on the rearrangement information;
• searching a job plan including a combination of jobs assigned to each of the operators by solving an optimization problem under a condition that the calculated evaluation value or a value based on the calculated evaluation value is to be minimized;
• and
• outputting the searched job plan.

A non-transitory computer-readable storage medium storing a job planning program that causes a computer to execute a process, the process comprising:

• receiving an input of rearrangement information and planning information, the rearrangement information including a content of a change of operators, each being a person or robot, assigned to stations on an assembly line and information about jobs to be assigned to the stations, the planning information including information about jobs that have been assigned to the operators before rearrangement;
• calculating an evaluation value from a number of jobs each being assigned to a different operator from an operator to which the job has been assigned in the planning information when the jobs are assigned to the operators based on the rearrangement information;
• searching a job plan including a combination of jobs assigned to each of the operators by solving an optimization problem under a condition that the calculated evaluation value or a value based on the calculated evaluation value is to be minimized;
• and
• outputting the searched job plan.