• français
    • English
  • français 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions

Thumbnail
Date
2019
Dewey
Gestion de production
Sujet
Transfer line; Balancing; Stability radius; Robustness; Uncertainty; Robust optimization; MILP; Heuristics; Pre-processing; Manufacturing
Journal issue
European Journal of Operational Research
Volume
290
Number
3
Publication date
05-2021
Article pages
946-955
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.ejor.2020.08.038
URI
https://basepub.dauphine.fr/handle/123456789/21421
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Pirogov, Aleksandr
473973 Laboratoire des Sciences du Numérique de Nantes [LS2N]
Gurevsky, Evgeny
473973 Laboratoire des Sciences du Numérique de Nantes [LS2N]
Rossi, André
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Dolgui, Alexandre
473973 Laboratoire des Sciences du Numérique de Nantes [LS2N]
Type
Article accepté pour publication ou publié
Abstract (EN)
This paper deals with an optimization problem, which arises when a new transfer line has to be designed subject to a limited number of available machines, cycle time constraint, and precedence relations between necessary production tasks. The studied problem consists in assigning a given set of tasks to blocks and then blocks to machines so as to find the most robust line configuration under task processing time uncertainty. The robustness of a given line configuration is measured via its stability radius , i.e. , as the maximal amplitude of deviations from the nominal value of the processing time of uncertain tasks that do not violate the solution admissibility. In this work, for considering different hypotheses on uncertainty, the stability radius is based upon the Manhattan and Chebyshev norms. For each norm, the problem is proven to be strongly NP-hard and a mixed-integer linear program (MILP) is proposed for addressing it. To accelerate the seeking of optimal solutions, two variants of a heuristic method as well as several reduction rules are devised for the corresponding MILP. Computational results are reported on a collection of instances derived from classic benchmark data used in the literature for the Transfer Line Balancing Problem.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.