October 10, 2025Open Access

Refined Iterated Pareto Greedy for Energy-aware Hybrid Flowshop Scheduling with Blocking Constraints

View Full Paper

Ask AI

Bookmark

Authors

AMAhmed MissaouiUniversity College Cork CÖCemalettin ÖztürkMunster Technological University BOBarry O’SullivanUniversity College Cork

Discussion

Member takes

Implication

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.

Cite This Study

Missaoui et al. (2025) studied this question.

synapsesocial.com/papers/68e861b07ef2f04ca37e4bd9 https://doi.org/10.48550/arxiv.2510.03377

View Full Paper

Ask AI

Bookmark

Implication

This study investigates hybrid flowshop scheduling with blocking constraints, demonstrating a new approach to minimize makespan and energy consumption.

Refined Iterated Pareto Greedy for Energy-aware Hybrid Flowshop Scheduling with Blocking Constraints

Discussion

Member takes

Implication

Key Points

Cite This Study

Refined Iterated Pareto Greedy for Energy-aware Hybrid Flowshop Scheduling with Blocking Constraints

Discussion

Member takes

Implication

Key Points

Cite This Study

Also Consider

Also Consider