Hierarchical Composition Heuristic for Sequence Dependent Scheduling Problems

摘要

This paper briefly reviews the scheduling procedures with sequence dependent setups developed by previous research. We present a procedure for single machines with asymmetric sequence dependent setups where the objective is to minimize the total setup time. We also illustrate the application of the procedure for an existing industrial problem. The procedure is named Hierarchical Composition Heuristic. It is a two-stage procedure that takes advantage of the natural product groupings. Therefore, it should be a very valuable scheduling tool for production environments that manufacture groups of items. A computational study of the procedure is reported along with general guidelines for application in similar scheduling environments.