Finding optimally balanced words for production planning and maintenance scheduling

Jeffrey Herrmann

IISE Transactions, 2012, vol. 44, issue 3, 215-229

Abstract: Balanced words are useful for scheduling mixed-model, just-in-time assembly lines; planning preventive maintenance; managing inventory; and controlling asynchronous transfer mode networks. This article considers the challenging problem of finding a balanced word (a periodic sequence) for a finite set of letters, when the desired densities of the letters in the alphabet are given. Two different measures of balance are considered. This article presents a branch-and-bound approach for finding optimally balanced words and presents the results of computational experiments to show how problem characteristics affect the time required to find an optimal solution. The optimal solutions are also used to evaluate the performance of an aggregation approach that combines letters with the same density, constructs a word for the aggregated alphabet, and then disaggregates this word into a feasible word for the original alphabet. Computational experiments show that using aggregation with the heuristics not only finds more balanced words but also reduces computational effort for larger instances.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2011.602660 (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:taf:uiiexx:v:44:y:2012:i:3:p:215-229

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2011.602660

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().