Grabowski, Józef; Smutnicki, Czesław The flow-shop problems. Properties, algorithms and applications. II. (Polish. Russian, English summaries) Zbl 0566.90048 Przegl. Stat. 31, 31-45 (1984). [For part I see ibid. 30, 275-288 (1983; Zbl 0537.90052).] - The basic goal of the paper is to solve the flow-shop problem with different non- zero ready times and the criterion for minimizing the maximum lateness. In the paper there are presented: some properties of the problem based on the critical path concept and blocks of jobs concept, the block-scheme of the algorithm, and the algorithm itself, based on the branch-and-bound method. Extensive results of the experimental examination of the algorithm are also presented. Possible applications of the algorithm are illustrated by an example of optimization of the rolling-mill process. MSC: 90B35 Deterministic scheduling theory in operations research 90C10 Integer programming 65K05 Numerical mathematical programming methods 90C90 Applications of mathematical programming Keywords:flow-shop problem; non-zero ready times; minimizing the maximum lateness; critical path concept; blocks of jobs concept; branch-and-bound; experimental examination; algorithm; rolling-mill process Citations:Zbl 0537.90052 PDFBibTeX XMLCite \textit{J. Grabowski} and \textit{C. Smutnicki}, Przegl. Stat. 31, 31--45 (1984; Zbl 0566.90048)