Improved heuristics for sequencing cutting patterns

Heuristics have been suggested as a means to sequence cutting patterns. Further heuristics are presented which appear to improve on the objective of minimizing the maximum queue of partially cut orders. Salient features of previous heuristics are adopted but other enhancements are also implemented. Computing experience is used as a means of substantiating the improvements achieved and establishing the optimality of the heuristics.