Deakin University
Browse

File(s) under permanent embargo

New formulations for the setup assembly line balancing and scheduling problem

journal contribution
posted on 2016-03-01, 00:00 authored by Rasul Esmaeilbeigi, B Naderi, P Charkhgard
We present three new formulations for the setup assembly line balancing and scheduling problem (SUALBSP). Unlike the simple assembly line balancing problem, sequence-dependent setup times are considered between the tasks in the SUALBSP. These setup times may significantly influence the station times. Thus, there is a need for scheduling the list of tasks within each station so as to optimize the overall performance of the assembly line. In this study, we first scrutinize the previous formulation of the problem, which is a station-based model. Then, three new formulations are developed by the use of new sets of decision variables. In one of these formulations, the schedule-based formulation, SUALBSP is completely formulated as a scheduling problem. That is, no decision variable in the model directly denotes a station. All the proposed formulations will be improved by the use of several enhancement techniques such as preprocessing and valid inequalities. These improved formulations can be applied to establishing lower bounds on the problem. To assess the performance of new formulations, results of an extensive computational study on the benchmark data sets are also reported.

History

Journal

OR Spectrum

Volume

38

Issue

2

Pagination

493 - 518

Publisher

Springer

Location

Berlin, Germany

ISSN

0171-6468

eISSN

1436-6304

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2016, Springer-Verlag Berlin Heidelberg