An Efficient Heuristic to Optimize the Cost of Scheduling Production Tasks on Non-identical Parallel Production Lines
摘要
This work presents a research contribution to the cost optimization of scheduling production tasks on non-identical parallel production lines. The approach proposed is a heuristic that incorporates a new priority rule based on the number of possible production lines. The aim of this approach is to minimize the overall cost while ensuring that all orders are (being processed) assigned to machines. Evaluated on several problems of different sizes, the proposed heuristic proves highly effective in generating optimal or near-optimal solutions.