Cost optimization for series–parallel execution of a collection of intersecting operation sets

Abstract

A collection of intersecting sets of operations is considered. These sets of operations are performed successively. The operations of each set are activated simultaneously. Operation durations can be modified. The cost of each operation decreases with the increase in operation duration. In contrast, the additional expenses for each set of operations are proportional to its time. The problem of selecting the durations of all operations that minimize the total cost under constraint on completion time for the whole collection of operation sets is studied. The mathematical model and method to solve this problem are presented. The proposed method is based on a combination of Lagrangian relaxation and dynamic programming. The results of numerical experiments that illustrate the performance of the proposed method are presented. This approach was used for optimization multi-spindle machines and machining lines, but the problem is common in engineering optimization and thus the techniques developed could be useful for other applications.

Keywords:

• sets of operations
• series–parallel execution
• operation costs and times
• line balancing
• process planning
• batch scheduling
• optimization
• Lagrangian relaxation
• dynamic programming

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work has been partially supported by CNRS PICS 6064 project (France–Belarus).