Hierarchical control of the two processor flowshop with state dependent processing times: Complexity analysis and approximate algorithms

Hierarchical control of the two processor flowshop with state dependent processing times: Complexity analysis and approximate algorithms

0.00 Avg rating—0 Votes
Article ID: iaor19912017
Country: Canada
Volume: 29
Issue: 3
Start Page Number: 193
End Page Number: 205
Publication Date: Aug 1991
Journal: INFOR
Authors: ,
Keywords: optimization, computational analysis
Abstract:

The problem of two processors in series and n parts is considered, when processing times depend on some state variable. It is first shown that the minimum makespan problem is NP-Hard in the strong sense. Then, four heuristic algorithms are described and compared in the linear dependence case.

Reviews

Required fields are marked *. Your email address will not be published.