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

Hazir O., Dolgui A.

COMPUTERS & OPERATIONS RESEARCH, vol.59, pp.126-131, 2015 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 59
  • Publication Date: 2015
  • Doi Number: 10.1016/j.cor.2015.01.010
  • Journal Name: COMPUTERS & OPERATIONS RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.126-131
  • Keywords: Assembly line balancing, Robust optimization, Combinatorial optimization, Benders decomposition, ROBUST OPTIMIZATION MODELS, ANT COLONY OPTIMIZATION, BENDERS DECOMPOSITION, TIME
  • TED University Affiliated: Yes

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.