Capacity and tool allocation problem in flexible manufacturing systems

Date

2006-06-01

Author

Bilgin, S.
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

168
views

0
downloads

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 problem is NP-hard in the strong sense. We show that the linear programming relaxation upper bound dominates the best possible Lagrangean relaxation upper bound. We develop several lower bounding procedures and a lower bounding procedure using Lagrangean relaxation approach. Our computational results show that the upper and lower bounding procedures produce near-optimal solutions in reasonable times.

Subject Keywords

Marketing, Management Science and Operations Research, Strategy and Management, Management Information Systems

URI

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

Journal

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

DOI

https://doi.org/10.1057/palgrave.jors.2602039

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2009-01-01) 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.
Considering manufacturing cost and scheduling performance on a CNC turning machine Gürel, Sinan (Elsevier BV, 2007-02-16) A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the manufacturing cost and its required processing time on a CNC turning machine. If we consider total manufacturing cost (F-1) and total weighted completion time (F-2) objectives simultaneously on a single CNC machine, making appropriate processing time decisions is as critical as making job sequencin...
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...
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria Ozlen, M.; Azizoğlu, Meral (Informa UK Limited, 2011-01-01) In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the follo...
Assessment of criteria - rich rankings for environmental policy making Yeralan, Sencer; Ozdoglar, Mehmet Rasit; Azizoğlu, Meral (Inderscience Publishers, 2011-12-01) This paper illustrates the use of mathematical programming techniques to extract more information out of composite indexes (e.g., the EPI-2008) that would assist decision makers. While recognising the qualitative aspects of such decision making, in order to support and guide the policy making process, we develop analytical tools to assist the process. We carefully delineate our models to be limited only to the provable quantitative properties of the available objective data. However, such data are processed...

Citation Formats

S. Bilgin and M. Azizoğlu, “Capacity and tool allocation problem in flexible manufacturing systems,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 670–681, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35402.