Beam search algorithm for capacity allocation problem in flexible manufacturing systems

Authors:
Selin Bilgin Özpeynirci;Meral Azizoğlu
Affiliations:
İzmir University of Economics, Department of Industrial Systems Engineering, 35330 Balçova, İzmir, Turkey;Middle East Technical University, Industrial Engineering Department, 0653l Ankara, Turkey
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 6
Cited 2

A branch and bound approach for machine load balancing in flexible manufacturing systems

Management Science
Loading tools to machines in flexible manufacturing systems

Computers and Industrial Engineering
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

Journal of Heuristics
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

Computers and Operations Research
Operation assignment and capacity allocation problem in automated manufacturing systems

Computers and Industrial Engineering

Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems

Computers and Operations Research
The activity-based aggregate production planning with capacity expansion in manufacturing systems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study considers the operation assignment and tool allocation problem in flexible manufacturing systems. A set of operations together with their required tools are selected so as to maximize the total weight. The machines have limited time and tool magazine capacities and the tools are available in limited quantities. We develop a beam search algorithm and obtain near optimal solutions for large size problems very quickly.