Groupe d’études et de recherche en analyse des décisions


Hierarchical Control of the Two-Processor Flow-Shop with State Dependent Processing Times 2. Complexity Analysis and Approximate Algorithms


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 problem is NP-Hard in the strong sense. Then, four heuristic algorithms are described and compared in the linear dependance case.

, 21 pages

Ce cahier a été révisé en mai 1990