An algorithm of job shop rolling scheduling based on singular rough sets

A new kind of rolling scheduling algorithm based on singular rough sets is put forward in the article. Under dynamic processing environment, a job identification problem in a rolling horizon optimal scheduling window is investigated. Using a new artificial intelligence method, singular rough sets, this article presents a new job identification algorithm of job shop rolling scheduling. It bases on the dynamic transfer characteristic and the assistant set of singular rough sets. In case of the machine failure, the due date of the jobs changed and the urgent job, the re-selection and re-scheduling of the jobs in the rolling window are executed once more. Solved by genetic algorithm, the illustration example verifies the effectively of the algorithm, not only the dynamic processing environment is adapted and a satisfied rescheduling result is obtained, but also the re-scheduling dimension is decreased.