Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Operation assignment and capacity allocation problem in automated manufacturing systems
Date
2009-03-01
Author
Bilgin, Selin
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
258
views
0
downloads
Cite This
We address an operation assignment and capacity allocation problem that arises in semiconductor industries and flexible manufacturing systems. We assume the automated machines 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. We show that the problem is NP-hard in the strong sense, develop two heuristics and a Tabu Search procedure. The results of our computational tests have revealed that our Tabu Search procedure produces near optimal solutions very quickly.
Subject Keywords
General Engineering
,
General Computer Science
URI
https://hdl.handle.net/11511/44742
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
DOI
https://doi.org/10.1016/j.cie.2007.04.003
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Beam search algorithm for capacity allocation problem in flexible manufacturing systems
Ozpeynirci, Selin Bilgin; Azizoğlu, Meral (Elsevier BV, 2009-05-01)
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.
SIMULATION CONCEPTS FOR INFORMATION-SYSTEM
MOURANT, RR; Tarı, Zehra Sibel (Elsevier BV, 1993-09-01)
Recent Improvements in document image systems and their low-cost implementation on networks of microcomputers is leading to the reengineering of many information systems. We describe how document image systems can be applied to information systems. In order to compare the performance of a conventional information system with one implemented with document imaging processing capability we conducted a discrete event simulation. We modeled the conventional information system for processing graduate student ...
Optimal scope of work for international integrated systems
Ertem, Mustafa Alp; Serpil, Canan; Department of Industrial Engineering (2005)
This study develops a systems integration project scheduling model which identifies the assignment of activity responsibilities that minimizes expected project implementation cost, considering the project risk. Assignment of resources to the individual jobs comprising the project is a persistent problem in project management. Mostly, skilled labor is an essential resource and both the time and the cost incurred to perform a job depend on the resource to which job is assigned. A systems integration project i...
Exact and heuristic approaches for joint maintenance and spare parts planning
Bulbul, Pinar; Bayındır, Zeynep Pelin; Bakal, İsmail Serdar (Elsevier BV, 2019-03-01)
In this study, we consider the joint problem of preventive replacement and spare parts inventory planning. We present an exact dynamic programming formulation to minimize the total expected cost over a finite planning horizon. As it is not possible to represent the optimal solution by a well-defined and practical policy, and the dynamic programming recursion is time-consuming to apply, we propose three heuristic approaches that are easy to understand and to implement in practice: (i) Steady-State Approximat...
Cyclic ordering policies from capacitated suppliers under limited cycle time
EKİCİ, ALİ; Ozener, Okan Orsan; Duran, Serhan (Elsevier BV, 2019-02-01)
In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective is to minimize total periodic ordering cost which has three components: (i) fixed ordering cost, (ii) variable purchasing cost, and (iii) inventory holding cost. We are interested in developing a cyclic ordering policy for the manufacturer where the orders are repeated with a certain freq...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Bilgin and M. Azizoğlu, “Operation assignment and capacity allocation problem in automated manufacturing systems,”
COMPUTERS & INDUSTRIAL ENGINEERING
, pp. 662–676, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/44742.