Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

Date

2009-01-01

Author

ÖZPEYNİRCİ, SELİN
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

195
views

0
downloads

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. The machines have limited time and tool magazine capacities and the available tools are limited. Our objective is to maximise total weight of assigned operations. We develop a branch and bound algorithm that finds the optimal solutions and a beam search algorithm that finds high quality solutions in polynomial time.

Subject Keywords

Management Science and Operations Research, Strategy and Management, Industrial and Manufacturing Engineering

URI

https://hdl.handle.net/11511/42073

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

DOI

https://doi.org/10.1080/00207540802154845

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01) This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
Flexibility analysis: a methodology and a case study Kahyaoglu, Y; Kayaligil, S; Buzacott, JA (Informa UK Limited, 2002-11-10) A methodology for analysing manufacturing flexibility is proposed. A real-life case is discussed to demonstrate the proposed methodology. The case involves the grinding operations of an engine manufacturer. As an integral part of the methodology, statistical analyses using response surface methodology are carried out. Potential applications of the proposed methodology are discussed. Planning models and flexibility measure used are outlined in the appendices.
Due date and cost-based FMS loading, scheduling and tool management Turkcan, Ayten; Akturk, M. Selim; Storer, Robert H. (Informa UK Limited, 2007-03-01) In this study, we consider flexible manufacturing system loading, scheduling and tool management problems simultaneously. Our aim is to determine relevant tool management decisions, which are machining conditions selection and tool allocation, and to load and schedule parts on non-identical parallel CNC machines. The dual objectives are minimization of the manufacturing cost and total weighted tardiness. The manufacturing cost is comprised of machining and tooling costs (which are affected by machining cond...
Capacity and tool allocation problem in flexible manufacturing systems Bilgin, S.; Azizoğlu, Meral (Informa UK Limited, 2006-06-01) This study addresses an allocation problem that arises in the semiconductor industry and flexible manufacturing systems where the tools should be loaded on computer numerical controlled (CNC) machines to process a number of operations. The time and tool magazine capacities of the CNC machines and the number of available tools of each type are limited. The objective is to maximize the total weight of operation assignments. We present a mixed integer programming formulation of the problem and show that the pr...
Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm Solyali, O.; Ozpeynirci, O. (Informa UK Limited, 2009-01-01) This study addresses the operational fixed job scheduling problem under spread time constraints. The problem is to select a subset of jobs having fixed ready times and deadlines for processing on identical parallel machines such that total weight of the selected jobs is maximised. We first give a mathematical formulation of the problem and then reformulate it using Dantzig-Wolfe decomposition. We propose a branch-and-price algorithm that works on the reformulation of the problem. Computational results show ...

Citation Formats

S. ÖZPEYNİRCİ and M. Azizoğlu, “Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 5941–5958, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42073.