DSpace@TEDU

A decomposition based solution algorithm for U-type assembly line balancing with interval data

Show simple item record

dc.contributor.author Hazir, Oncu
dc.contributor.author Dolgui, Alexandre
dc.date.accessioned 2019-06-25T14:12:02Z
dc.date.available 2019-06-25T14:12:02Z
dc.date.issued 2015
dc.identifier.issn 0305-0548
dc.identifier.issn 1873-765X
dc.identifier.uri https://doi.org/10.1016/j.cor.2015.01.010
dc.identifier.uri https://acikerisim.tedu.edu.tr/xmlui/handle/20.500.12485/130
dc.description.abstract Balancing U-type assembly lines under uncertainty is addressed in this paper by formulating a robust problem and developing its optimization model and algorithm. U-type assembly layouts are shown to be more efficient than conventional straight lines. A great majority of studies on U-lines assume deterministic environments and ignore uncertainty in operation times. We aim to fill this research gap and, to the best of our knowledge, this study will be the first application of robust optimization to U-type assembly planning. en_US
dc.language.iso en en_US
dc.publisher PERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND en_US
dc.subject Computer Science en_US
dc.subject Engineering; Operations Research & Management Science en_US
dc.title A decomposition based solution algorithm for U-type assembly line balancing with interval data en_US
dc.type Article en_US
dc.relation.journal Computers & Operations Research
dc.identifier.startpage 126
dc.identifier.endpage 131
dc.identifier.volume 59


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account

Statistics