Abstract: An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling ...

Abstract: Deterministic processing time are no longer applicable under realistic circumstances because of the uncertainties involved in manufacturing and production processes. The present study aims ...

FedRG-MARL is designed for coordinated electric vehicle scheduling in regional multi-park microgrids under shared-transformer coupling, heterogeneous resources, stochastic charging demand, and privacy ...

A Lightweight and User-Friendly EoH Framework for LLM-driven Automated Algorithm/Heuristic Design Heuristics are indispensable for tackling complex search and optimization problems. However, manual ...

This research examines the cyclic re-entrant hybrid flow shop (CRHFS) scheduling problem with sequence-dependent setup times (SDST), inspired by photolithography applications. This study is, to the ...

A probably more complete list of papers, along with full bibliographical information can be found at the University of Trier Computer Science Bibliography database. Hongbo Kang, Yiwei Zhao, Guy E.