Journal article
Product grouping for batch processes
International journal of production research, Vol.34(11), pp.3095-3105
11/01/1996
DOI: 10.1080/00207549608905079
Abstract
This paper considers a production environment in which multiple products produced in a batch process share several facilities, and the products must be grouped (or, equivalently, assigned to facilities) so as to minimize associated inventory carrying costs (an NP-hard problem). The main contributions of the paper are (1) to derive a polynomial-time procedure that computes optimal solutions to an important special case of the problem, (2) to extend the procedure as an heuristic to the more general case, and (3) to demonstrate computationally that the heuristic is remarkably effective in the general case.
Details
- Title: Subtitle
- Product grouping for batch processes
- Creators
- P. C. Jones - University of IowaR. R. Inman - General Motors
- Resource Type
- Journal article
- Publication Details
- International journal of production research, Vol.34(11), pp.3095-3105
- DOI
- 10.1080/00207549608905079
- ISSN
- 0020-7543
- eISSN
- 1366-588X
- Publisher
- Taylor & Francis Group
- Number of pages
- 11
- Language
- English
- Date published
- 11/01/1996
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963213202771
Metrics
1 Record Views