Single batch-processing machine scheduling problem with interval grey processing time

Abstract

This paper investigates a single batch-processing machine scheduling problem with uncertain processing time. The uncertain processing time is characterized by interval grey number. A grey mixed integer linear programming model is established to formulate this uncertain scheduling problem to minimize the makespan. To solve this problem, a genetic algorithm with targeted population generation and neighbourhood search is designed. The results of experiments demonstrate that the proposed algorithm has excellent performance in both efficiency and stability. The resulting scheduling scheme can be shown through the Gantt chart with interval grey processing time, offering a novel approach for visualizing scheduling schemes with uncertain processing time.