Part selection and tool allocation in discrete parts manufacturing

Eleftherios Iakovou, Christos Koulamas and Kavindra Malik

Annals of Operations Research, 1998, vol. 76, issue 0, 187-200

Abstract: A recurrent problem in discrete parts manufacturing is to select the optimal mix of parts and to allocate the necessary tools on a machine's carousel in order to maximize net profit. We formulate the problem as an integer program and compute an upper bound for the optimal solution. We then develop a greedy type heuristic to obtain a lower bound on the value of the optimal solution. Further, we show that the worst case relative error of the proposed heuristic approaches 1y2. Finally, we demonstrate via extensive computational experimentation that the greedy heuristic produces near optimal solutions for a variety of problem instances. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018940420058 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:76:y:1998:i:0:p:187-200:10.1023/a:1018940420058

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018940420058

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().