Model and Solution of Job-shop Scheduling for Parallel Processes

Focusing on the merit of process parallelism existing in the actual production,a job-shop scheduling model for parallel processes is proposed in this paper which aims to minimize makespan and considers machine flexibility among production processes.This model is implemented with a genetic algorithm-based scheduling algorithm in which a blocking encode method is used and a corresponding decode measure is put forward,which is suitable for parallel processes.The experiment result shows that the scheduling algorithm can solve the job-shop scheduling problem with parallel processes effectively.