A heuristic algorithm for the two-machine flowshop group scheduling problem

This paper presents the two-machine flowshop hop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance rules along with a previously established dominance rule are used to develop a heuristic algorithm. Experimental results are given and analyzed.