Pareto-optimal front of cell formation problem in group technology

Julius Žilinskas (), Boris Goldengorin () and Panos Pardalos ()

Journal of Global Optimization, 2015, vol. 61, issue 1, 108 pages

Abstract: The earliest approaches to the cell formation problem in group technology, dealing with a binary machine-part incidence matrix, were aimed only at minimizing the number of intercell moves (exceptional elements in the block-diagonalized matrix). Later on this goal was extended to simultaneous minimization of the numbers of exceptions and voids, and minimization of intercell moves and within-cell load variation, respectively. In this paper we design the first exact branch-and-bound algorithm to create a Pareto-optimal front for the bi-criterion cell formation problem. Copyright Springer Science+Business Media New York 2015

Keywords: Cell formation problem; Multi-objective optimization; Branch and bound (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-014-0154-6 (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:jglopt:v:61:y:2015:i:1:p:91-108

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-014-0154-6

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().