Beam search algorithms for the mixed-model assembly line sequencing problem

Date

2005

Editor(s)

Advisor

Sabuncuoğlu, İhsan

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
7
downloads

Series

Abstract

In this thesis, we study the mixed-model assembly line sequencing problem that considers the following objectives: 1) leveling the part usage, and 2) leveling workload on the final assembly line. We propose Beam Search algorithms for this problem. Unlike the traditional Beam Search, the proposed algorithms have information exchange and backtracking capabilities. The performances of the proposed algorithms are compared with those of the heuristics in the literature. The results indicate that the proposed methods generally outperform the existing heuristics. A comprehensive bibliography is also provided in this study.

Source Title

Publisher

Course

Other identifiers

Book Title

Degree Discipline

Industrial Engineering

Degree Level

Master's

Degree Name

MS (Master of Science)

Citation

Published Version (Please cite this version)

Language

English

Type