Balancing of simple assembly lines under variations of task processing times
Evgeny Gurevsky (),
Olga Battaïa () and
Alexandre Dolgui ()
Annals of Operations Research, 2012, vol. 201, issue 1, 265-286
Abstract:
One of the simple assembly line balancing problems (SALBPs), known as SALBP-E, is considered. It consists in assigning a given set V={1,2,…,n} of elementary tasks to linearly ordered workstations with respect to precedence and capacity restrictions while minimizing the following product: number of used workstations × working time on the most loaded one. The stability of feasible and optimal solutions for this problem with regard to possible variations of the processing time of certain tasks is investigated. Two heuristic procedures finding a compromise between the efficiency and the considered stability measure of studied solutions are suggested and evaluated on known benchmarks. Copyright Springer Science+Business Media, LLC 2012
Keywords: Stability/sensitivity analysis; Uncertainty; Assembly line balancing problems (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-012-1203-5 (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:201:y:2012:i:1:p:265-286:10.1007/s10479-012-1203-5
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-012-1203-5
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 ().