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

Authors:
Selin Özpeynirci;Meral Azizoğlu
Affiliations:
Department of Industrial Systems Engineering, İzmir University of Economics, Sakarya Cad. No. 156, 35330 Balçova, İzmir, Turkey;Industrial Engineering Department, Middle East Technical University, 06531 Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2009

Citing 7
Cited 1

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
Exact solution procedures for certain planning problems in flexible manufacturing systems

Computers and Operations Research
Tool capacity planning in semiconductor manufacturing

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

Computers and Industrial Engineering
Beam search algorithm for capacity allocation problem in flexible manufacturing systems

Computers and Industrial Engineering

A real-time production operations decision support system for solving stochastic production material demand problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. Automated machines are assumed to have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. The weight of an operation may represent its profit, processing load, relative priority. Several upper bounding procedures have been taken into account. The results of computational tests have revealed that the proposed upper bounding procedures produce satisfactory solutions in reasonable CPU times. We suggest using some of the bounds when the quality of the solutions is more important than the speed of achieving them and some others when the speed is more important than the quality.