Scheduling Algorithms for the Unbalanced Production Line: An Analysis and Comparison

Publisher Website
Google Scholar
Abstract
This paper presents an analysis and comparison of scheduling algorithms for the unbalanced production line. A new heuristic algorithm is presented accompanied by an index for classifying the configuration of a production line. A factorial experiment was conducted in order to determine those factors which were significant with respect to the performance measure under consideration, the average cost of holding in-process inventory. Additional analyses were then performed on the line factors and scheduling algorithms with appropriate conclusions drawn. The best performing algorithm was then compared to the performance of Single Period integer programming over a multiple time frame. The heuristic algorithm was found to yield better average performance than the integer programming solution, although the differences were not statistically significant. Recommendations concerning the implementation of the heuristic algorithm are provided.

This publication has 1 reference indexed in Scilit: