S. T. McCormick, S. R. Smallwood and F. C. R. Spieksma, “A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths,” Mathematics of Operations Research, Vol. 26, No. 1, 2001, pp. 31-49.

has been cited by the following article:

• TITLE: A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights

  AUTHORS: M. Z. Arslanov

  KEYWORDS: Cutting; Convex Hull; Polynomial Algorithms

  JOURNAL NAME: American Journal of Operations Research, Vol.4 No.1, January 23, 2014

  ABSTRACT: We consider the problem of guillotine cutting a rectangular sheet into rectangular pieces with two heights. A polynomial time algorithm for this problem is constructed.