[For the entire collection see Zbl 0699.00039.] The paper reviews some recent results for the classical job shop problem from machine scheduling. Firstly, a new form of modelling the problem by means of latin rectangles is presented. The representation of a schedule by a latin rectangle avoids feasibility investigations which are necessary if machine and job order are separately considered. Based on this modelling a new enumeration strategy for the exact solution of the considered problem is derived. Lower bounds are shortly discussed. The developed constructions and iteration algorithms are summarized. The underlying neighbourhood structures have been investigated.
H.Bräsel