Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477646 | European Journal of Operational Research | 2008 | 11 Pages |
Abstract
This article focuses on the minimization of the setup costs of a workshop modeled with parallel multi-purpose machines. Any admissible workshop configuration has to ensure that a load-balanced production plan meeting a given demand exists. This problem is shown to be NP-hard in the strong sense, and is stated as a mixed integer linear program. It is shown that under some hypotheses, it can be stated as a transportation problem and solved in polynomial time. An upper bound and lower bound are proposed, as well as a performance ratio assessment that is reached only when degenerate optimal solutions to the transportation problem exist.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
A. Aubry, A. Rossi, M.-L. Espinouse, M. Jacomino,