A NOTE ON THE REEL ALLOCATION PROBLEM

1 May 1994

journal article
research article
Published by Taylor & Francis in IIE Transactions

Vol. 26 (3) , 111-114
https://doi.org/10.1080/07408179408966613

Abstract

The reel allocation problem is to choose the numbers of reels of each of a number of types of items to be used in populating a printed circuit board by a SMT machine so as to maximize the length of an uninterrupted machine production run while using no more slots for reels than are available. We show this problem can be solved to optimality very efficiently with a quite simple and robust bisection search algorithm. Algorithm run times are less than 1 second on a 486 PC.

Keywords

This publication has 3 references indexed in Scilit:

Component Allocation and Partitioning for a Dual Delivery Placement Machine
Operations Research, 1988
An O(n) algorithm for quadratic knapsack problems
Operations Research Letters, 1984
On Marginal Allocation in Single Constraint Min-Max Problems
Management Science, 1971