A new branch and bound algorithm for loading problems in flexible manufacturing systems

Loading problems in flexible manufacturing systems involve assigning operations for selected part types and their associated tools to machines or machine groups. One of the objectives might be to maximize the expected production rate (throughput) of the system. Because of the difficulty in dealing with this objective directly, a commonly used surrogate objective is the closeness of the actual workload allocation to the continuous workload allocation that maximizes throughput. We test several measures of closeness and discuss correlations between these measures and throughput. Using the best measure, we show how to modify an existing branch and bound algorithm which was developed for the case of equal target workloads for all machine groups to accommodate unequal target workloads. We also develop a new branch and bound algorithm which can be used for both types of problems. The efficiency of the algorithm in finding optimal solutions is achieved through the application of better branching rules and improved dominance results. Computational results on randomly generated test problems indicate that the new algorithm performs well.

[1]  Kripa Shanker,et al.  A loading and dispatching problem in a random flexible manufacturing system , 1985 .

[2]  David D. Yao,et al.  Reducing the congestion in a class of job shops , 1987 .

[3]  David D. Yao,et al.  Some properties of the throughput function of closed networks of queues , 1985 .

[4]  F. Brian Talbot,et al.  Heuristics for loading flexible manufacturing systems , 1995 .

[5]  Kathryn E. Stecke,et al.  Loading and control policies for a flexible manufacturing system , 1981 .

[6]  Andrew Kusiak.  Loading models in flexible manufacturing systems , 1995 .

[7]  Subhash C. Sarin,et al.  The machine loading and tool allocation problem in a flexible manufacturing system , 1987 .

[8]  Randall P. Sadowski,et al.  A mixed integer program for loading and scheduling multiple flexible manufacturing cells , 1986 .

[9]  David D. Yao,et al.  Some order relations in closed networks of queues with multiserver stations , 1987 .

[10]  Kathryn E. Stecke,et al.  Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems , 1983 .

[11]  Thomas L. Morin,et al.  The optimality of balancing workloads in certain types of flexible manufacturing systems , 1985 .

[12]  Kathryn E. Stecke,et al.  On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks , 1990, Oper. Res..

[13]  Kathryn E. Stecke,et al.  The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues , 1985, Oper. Res..

[14]  J. George Shanthikumar,et al.  Optimal server allocation in a system of multi-server stations , 1987 .

[15]  David D. Yao,et al.  On Server Allocation in Multiple Center Manufacturing Systems , 1988, Oper. Res..

[16]  Leon F. McGinnis,et al.  A large scale machine loading problem in flexible assembly , 1985 .

[17]  Kathryn E. Stecke,et al.  A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems , 1986 .

[18]  C. Yano,et al.  HEURISTIC APPROACHES FOR LOADING PROBLEMS IN FLEXIBLE MANUFACTURING SYSTEMS , 1993 .

[19]  Kathryn E. Stecke,et al.  A Hierarchical approach to solving machine grouping and loading problems of flexible manufacturing systems , 1986 .

[20]  Kathryn E. Stecke,et al.  Reducing work-in-process inventory in certain classes of flexible manufacturing systems , 1986 .

[21]  A. S. Carrie,et al.  Work scheduling in FMS under tool availability constraints , 1986 .

[22]  R. S. Lashkari,et al.  A new formulation of operation allocation problem in flexible manufacturing systems: mathematical modelling and computational experience , 1987 .