Permutation flowshop scheduling problem with Total Core Idle Time Minimization

In this paper, we present a deterministic permutation flowshop scheduling problem with new objective function, the total core idle time. The interest of is related to reduce energy consumption system, taking into account that needed during processing times constant, and machines are switched off front back times. Therefore, dependent on time where in stand-by mode, i.e between jobs, named as Constructive heuristics metaheuristics adapted from literature for classical objectives makespan completion Additionally, variant one metaheuristic proposed, VBIH-P. An experimental evaluation has been carried out analyse performance all methods. results show an excellent VBIH-P compared