A heuristic algorithm for scheduling hazardous waste incinerators.

摘要

This research developed a method for efficiently scheduling waste feeds to an industrial hazardous waste incinerator. The research developed a simulated annealing linear programming heuristic to solve the problem. Operating data from an industrial incinerator was used to test the algorithm. The algorithm proved effective on scheduling commercial size problems. Computational experiments indicate the problem is less challenging if a single permit limit is more binding than the individual lance limits. The algorithm was implemented in Microsoft Visual C++(TM) with COIN-OR CLP(TM) employed to solve the linear program. Microsoft Access(TM) was employed to store the problem and output schedules so that the algorithm can be deployed to a generic incinerator environment.;Part of the field study included a six-sigma project to improve the scheduling of feeds to an industrial incinerator at the sponsoring company's plant. The author spent a summer working at the incinerator site as a member of a production scheduling team. The purpose of the project was to study and provide improvements to the scheduling process. Some of the tools developed during the project are in use at the plant. Details and improvements made to the scheduling process are included in this field study.