Capacity analysis in a serial production line

Baygın, Özlem


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.
Capacity scheduling and production planning of a new copper smelting system at Rize-Çayeli-Madenköy
Turfanda, Orhan; Department of Industrial Engineering (1976)
Capacity planning and range setting quantity flexibility contracts as a manufacturer
Pesen, Şafak; Kayalıgil, Sinan; Department of Industrial Engineering (2003)
Quantity Flexibility contract is an arrangement where parties agree upon a scheme of forming ranges on volumes for their future transactions. The contract is based on setting upper and lower limits on replenishment orders as simple multiples of point estimates updated, published and committed by the buyers. We introduce a manufacturer with a limited capacity; also capable of subcontracting, for deliveries with a known lead time. He offers a Quantity Flexibility (QF) contract to a buyer while he has an activ...
Capacity evaluation of damaged and repaired structures
Gür, Türel; Sucuoğlu, Haluk; Department of Civil Engineering (1999)
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...
Citation Formats
Ö. Baygın, “Capacity analysis in a serial production line,” Middle East Technical University, 1993.