Earliness/Tardiness Scheduling Problem under Uncertainty Based on Grey Chance Constrained Programming

Earliness/tardiness (E/T) scheduling problem under uncertainty are studied in this paper. The main work is to investigate the flow shop scheduling problem with distinct due windows. Uncertain processing time is expressed by grey number. The concept and method of grey simulation was put forward and grey simulation method was used to give the solution method for grey chance constrained programming. Finally, mathematical model for E/T flow shop scheduling which includes grey parameters is studied in details and how to use grey simulation technology to get the best result based on genetic algorithm is introduced. The effectiveness of the model and method is verified by simulation results