Beam search algorithm for capacity allocation problem in flexible manufacturing systems

Ozpeynirci, Selin Bilgin
Azizoğlu, Meral
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.


Operation assignment and capacity allocation problem in automated manufacturing systems
Bilgin, Selin; Azizoğlu, Meral (Elsevier BV, 2009-03-01)
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 o...
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...
A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect
Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01)
This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...
Single machine scheduling with maximum earliness and number tardy
Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01)
In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...
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 ...
Citation Formats
S. B. Ozpeynirci and M. Azizoğlu, “Beam search algorithm for capacity allocation problem in flexible manufacturing systems,” COMPUTERS & INDUSTRIAL ENGINEERING, pp. 1464–1473, 2009, Accessed: 00, 2020. [Online]. Available: