Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
Additional Document Info
Minimization of the total completion time in two-machine group scheduling problems with sequence-dependent setups that are typically found in discrete parts manufacturing is discussed. Four different lower bounding mechanisms are developed to identify a lower bound for all problems attempted. And the largest of the four is aptly used in the evaluation of the percentage deviation of the search algorithms to assess their efficacy. The problem sizes are classified as small, medium and large, and to accommodate the variability that might exist in the sequence-dependent setup times on both machines.