Deterministic search algorithm for sequencing and scheduling

Abstract

Many sequencing and scheduling problems are recognized as being NP-complete combinatorial problems. This class of problems often necessitates the use of near-optimal solution techniques including heuristics and meta-heuristics. The recently developed H-K general purpose heuristic has been successfully demonstrated on members of this class. This chapter proposes the use of this deterministic heuristic for use on complex scheduling problems. Specifically, the heuristic is applied to a newly defined problem from the field of environmentally conscious manufacturing, the goal of which is to determine a product's part removal schedule. This schedule provides the sequence of parts to be removed from a product at its end-of-life on a paced reverse-manufacturing line. It seeks not only to determine a sequence that is feasible (due to precedence constraints) but also to minimize the number of workers on the line, equalize the time level-of-effort of each, remove environmentally hazardous and high-demand parts early on, and to schedule the removal of parts with similar removal directions adjacently. In addition, the problem used in this chapter is shown to be similar to the Multiprocessor Scheduling Problem, a comparison that is further carried through the application of a complexity proof. Finally, a scheduling application of the H-K heuristic is demonstrated using an electronic product case study from the literature. © 2008 Springer-Verlag Berlin Heidelberg.