Loading problems of Flexible Manufacturing Systems (FMSs) have usually been formulated as an integer program with nonlinear constraints for tool magazine capacities. The nonlinearity and integer nature of the problem results in the loading problem being difficult to solve. Conventional branch-and-bound methods have been proposed, but again the solution time can easily be excessive for moderate sized problems. In this paper, we present an alternative formulation of the FMS loading problem. Such a formulation defines more decision variables, but is able to avoid nonlinearity of the constraints. It also includes the time availabilities of the machines as additional constraints. The main feature of the formulation is that it exhibits a block angular structure. By exploiting this special structure, an efficient branch-and-bound algorithm can be developed. This algorithm has the attractive feature that the bounds of the branches can be computed through simple procedures based on the solution of linear knapsack ...
[1]
Kathryn E. Stecke,et al.
Heuristic loading algorithms for flexible manufacturing systems
,
1983
.
[2]
Gary A Kochman.
Computer Programs for Decomposition in INteger Programming.
,
1976
.
[3]
G. Kochman.
Decomposition in integer programming
,
1976
.
[4]
Kathryn E. Stecke,et al.
A Hierarchical approach to solving machine grouping and loading problems of flexible manufacturing systems
,
1986
.
[5]
A. S. Carrie,et al.
Work scheduling in FMS under tool availability constraints
,
1986
.
[6]
Kathryn E. Stecke,et al.
A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
,
1986
.
[7]
Kathryn E. Stecke,et al.
Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
,
1983
.