Home > Research > Publications & Outputs > Stability factor for robust balancing of simple...

Electronic data

  • SF-SALBP.2021.09.28

    Rights statement: This is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, 318, 2022 DOI: 10.1016/j.dam.2022.03.024

    Accepted author manuscript, 285 KB, PDF document

    Available under license: CC BY-NC-ND

Links

Text available via DOI:

View graph of relations

Stability factor for robust balancing of simple assembly lines under uncertainty

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Stability factor for robust balancing of simple assembly lines under uncertainty. / Gurevsky, Evgeny; Rasamimanana, Andry; Pirogov, Aleksandr et al.
In: Discrete Applied Mathematics, Vol. 318, 15.09.2022, p. 113-132.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Gurevsky, E, Rasamimanana, A, Pirogov, A, Dolgui, A & Rossi, A 2022, 'Stability factor for robust balancing of simple assembly lines under uncertainty', Discrete Applied Mathematics, vol. 318, pp. 113-132. https://doi.org/10.1016/j.dam.2022.03.024

APA

Gurevsky, E., Rasamimanana, A., Pirogov, A., Dolgui, A., & Rossi, A. (2022). Stability factor for robust balancing of simple assembly lines under uncertainty. Discrete Applied Mathematics, 318, 113-132. https://doi.org/10.1016/j.dam.2022.03.024

Vancouver

Gurevsky E, Rasamimanana A, Pirogov A, Dolgui A, Rossi A. Stability factor for robust balancing of simple assembly lines under uncertainty. Discrete Applied Mathematics. 2022 Sept 15;318:113-132. Epub 2022 Jun 17. doi: 10.1016/j.dam.2022.03.024

Author

Gurevsky, Evgeny ; Rasamimanana, Andry ; Pirogov, Aleksandr et al. / Stability factor for robust balancing of simple assembly lines under uncertainty. In: Discrete Applied Mathematics. 2022 ; Vol. 318. pp. 113-132.

Bibtex

@article{ac3d80f10d0b4319b7e0a56784005811,
title = "Stability factor for robust balancing of simple assembly lines under uncertainty",
abstract = "This paper deals with an optimization problem, which arises when a new simple assembly line has to be designed subject to a fixed number of available workstations, cycle time constraint, and precedence relations between necessary assembly tasks. The studied problem consists in assigning a given set of tasks to workstations so as to find the most robust line configuration, which can withstand processing time uncertainty as much as possible. The line robustness is measured by a new indicator, called stability factor. In this work, the studied problem is proven to be strongly NP-hard, upper bounds are proposed, and the relation of the stability factor with another robustness indicator, known as stability radius, is investigated. A mixed-integer linear program (MILP) is proposed for maximizing the stability factor in the general case, and an alternative formulation is also derived when uncertainty originates in workstations only. Computational results are reported on a collection of instances derived from classic benchmark data used in the literature for the Simple Assembly Line Balancing Problem (SALBP).",
keywords = "Assembly line, Balancing, Robustness, Robust optimization, Stability radius, Uncertainty, MILP",
author = "Evgeny Gurevsky and Andry Rasamimanana and Aleksandr Pirogov and Alexandre Dolgui and Andre Rossi",
note = "This is the author{\textquoteright}s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, 318, 2022 DOI: 10.1016/j.dam.2022.03.024",
year = "2022",
month = sep,
day = "15",
doi = "10.1016/j.dam.2022.03.024",
language = "English",
volume = "318",
pages = "113--132",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Stability factor for robust balancing of simple assembly lines under uncertainty

AU - Gurevsky, Evgeny

AU - Rasamimanana, Andry

AU - Pirogov, Aleksandr

AU - Dolgui, Alexandre

AU - Rossi, Andre

N1 - This is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, 318, 2022 DOI: 10.1016/j.dam.2022.03.024

PY - 2022/9/15

Y1 - 2022/9/15

N2 - This paper deals with an optimization problem, which arises when a new simple assembly line has to be designed subject to a fixed number of available workstations, cycle time constraint, and precedence relations between necessary assembly tasks. The studied problem consists in assigning a given set of tasks to workstations so as to find the most robust line configuration, which can withstand processing time uncertainty as much as possible. The line robustness is measured by a new indicator, called stability factor. In this work, the studied problem is proven to be strongly NP-hard, upper bounds are proposed, and the relation of the stability factor with another robustness indicator, known as stability radius, is investigated. A mixed-integer linear program (MILP) is proposed for maximizing the stability factor in the general case, and an alternative formulation is also derived when uncertainty originates in workstations only. Computational results are reported on a collection of instances derived from classic benchmark data used in the literature for the Simple Assembly Line Balancing Problem (SALBP).

AB - This paper deals with an optimization problem, which arises when a new simple assembly line has to be designed subject to a fixed number of available workstations, cycle time constraint, and precedence relations between necessary assembly tasks. The studied problem consists in assigning a given set of tasks to workstations so as to find the most robust line configuration, which can withstand processing time uncertainty as much as possible. The line robustness is measured by a new indicator, called stability factor. In this work, the studied problem is proven to be strongly NP-hard, upper bounds are proposed, and the relation of the stability factor with another robustness indicator, known as stability radius, is investigated. A mixed-integer linear program (MILP) is proposed for maximizing the stability factor in the general case, and an alternative formulation is also derived when uncertainty originates in workstations only. Computational results are reported on a collection of instances derived from classic benchmark data used in the literature for the Simple Assembly Line Balancing Problem (SALBP).

KW - Assembly line

KW - Balancing

KW - Robustness

KW - Robust optimization

KW - Stability radius

KW - Uncertainty

KW - MILP

U2 - 10.1016/j.dam.2022.03.024

DO - 10.1016/j.dam.2022.03.024

M3 - Journal article

VL - 318

SP - 113

EP - 132

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -