In reality, processing times are often imprecise and this imprecision is critical for the scheduling procedure. This research deals with flow-shop scheduling in rough environment. In this type of scheduling problem, ...In reality, processing times are often imprecise and this imprecision is critical for the scheduling procedure. This research deals with flow-shop scheduling in rough environment. In this type of scheduling problem, we employ the rough sets to represent the job parameters. The job processing times are assumed to be rough variables, and the problem is to minimize the makespan. Three novel types of rough scheduling models are presented. A rough simulation-based genetic algorithm is designed to solve these models and its effectiveness is well illustrated by numerical experiments.展开更多
基金Supported by the National Natural Science Foundationof China ( No. 6 0 1740 49),the Sino- French JoinL aboratory for Research in Com puter Science,Controland Applied Mathematics ( L IAMA ),and the KeyProject ( No.2 0 0 1A430 0 7) of Education D
文摘In reality, processing times are often imprecise and this imprecision is critical for the scheduling procedure. This research deals with flow-shop scheduling in rough environment. In this type of scheduling problem, we employ the rough sets to represent the job parameters. The job processing times are assumed to be rough variables, and the problem is to minimize the makespan. Three novel types of rough scheduling models are presented. A rough simulation-based genetic algorithm is designed to solve these models and its effectiveness is well illustrated by numerical experiments.
