Article ID Journal Published Year Pages File Type
10347637 Computers & Operations Research 2012 10 Pages PDF
Abstract
► We study the hybrid flow shop problem with precedence relations. ► An adaptive randomized list scheduling heuristic is proposed. ► Two global lower bounds are examined. ► Distance to the optimum, in average, is under 5% for randomly generated instances.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
Authors
, , , ,