This study investigates hybrid flowshop scheduling with blocking constraints, demonstrating a new approach to minimize makespan and energy consumption.
Key Points
The proposed method minimizes makespan while simultaneously reducing energy consumption in manufacturing processes.
Effectiveness is evaluated using the refined iterated Pareto greedy algorithm against two well-known scheduling algorithms.
Multi-objective mixed integer programming (MIP) is utilized to balance conflicting objectives in scheduling.
The computational results indicate that the proposed methods can handle large instances efficiently.