Home > Research > Publications & Outputs > Partial disassembly line balancing under uncert...

Electronic data

  • IMBO final

    Accepted author manuscript, 496 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License


Text available via DOI:

View graph of relations

Partial disassembly line balancing under uncertainty: robust optimisation models and an improved migrating birds optimisation algorithm

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>19/05/2021
<mark>Journal</mark>International Journal of Production Research
Issue number10
Number of pages19
Pages (from-to)2977-2995
Publication StatusPublished
Early online date27/03/20
<mark>Original language</mark>English


A partial disassembly line balancing problem under uncertainty is studied in this paper, which concerns the allocation of a sequence of tasks to workstations such that the overall profit is maximised. We consider the processing time uncertainty and develop robust solutions to accommodate it. The problem is formulated as a non-linear robust integer program, which is then converted into an equivalent linear program. Due to the intractability of such problems, the exact algorithms are only applicable to small-scale instances. We develop an improved migrating birds optimisation algorithm. Two enhancement techniques are proposed. The first one finds the optimal number of tasks to be performed for each sequence rather than random selection used in the literature; while the second one exploits the specific problem structure to construct effective neighbourhoods. The numerical results show the strong performance of our proposal compared to CPLEX and the improved gravitational search algorithm (IGSA), especially for large-scale problems. Moreover, the enhancement due to the proposed techniques is obvious across all instances considered.