A Sustainable Parallel-machine Scheduling Problem with Time Constraint Based on Hybrid Metaheuristic Algorithm

Sustainable scheduling is of great significance for modern manufacturing companies' long-term development. In this paper, we focus on a sustainable parallel-machine scheduling problem with time constraint, which comes from a rubber manufacturing enterprise. Sustainable demands of this problem include economic benefit (completion time constraint) and environmental effect (energy consumption objective). Besides, this problem not only schedule jobs but also decide the processing speed of machines. We analyze the complexity of the problem and develop a hybrid metaheuristic algorithm to effectively tackle the problem. Experimental results of a case study and comparative analysis show the effectiveness of the proposed algorithm.