A study of rescheduling strategies and abstraction levels for a chemical process scheduling problem
Patrick Van Bael · Production Planning & Control · 1999
This paper describes a scheduling algorithm developed to solve chemical process scheduling problems (CPSP) which belong to the job shop scheduling problems and are known to be NP-hard combinatorial optimization problems. The problem is solved using an iterative improvement algorithm in combination with a constraint satisfaction problem paradigm. Within the algorithm different rescheduling strategies based on a generative or iterative repair mechanism are examined. The final solution strategy to build rapidly near-optimal schedules combines high and low level scheduling with each using a different rescheduling strategy.