科研之友
微信
新浪微博
Facebook
分享链接
摘要
This article presents an algorithm for scheduling waste feeds for a hazardous waste incinerator based on a simulated annealing linear programming heuristic. The originality of the formulation and solution procedure of the incinerator scheduling problem lies in the large number and type of utility constraints used to model permit and other limits. The algorithm is effective on large scheduling problems with 200 jobs and 10 feed points. Computational experiments suggest that the incinerator scheduling problem is easier to solve to a lower bound for a makespan objective if the permit limits are more restrictive than the individual feed point limits. To aid in understanding the schedule produced, the scheduling problem is repetitively solved to determine the variation in alternative schedules. This unique analysis demonstrates that multiple solutions to the scheduling problem exist with similar makespans. These alternative solutions are due to the tightness of the permit limit constraints for this problem and the makespan objective. The article suggests several secondary objectives to generate a unique solution. The proposed algorithm can be utilized by incinerator operators to improve efficiency.
- 出版日期2010-7
