Search

Your search keyword '"Evgeny Gurevsky"' showing total 22 results
Start Over Author "Evgeny Gurevsky"
22 results on '"Evgeny Gurevsky"'

2. Stability factor for robust balancing of simple assembly lines under uncertainty

Author

Evgeny Gurevsky, Andry Rasamimanana, Aleksandr Pirogov, Alexandre Dolgui, André Rossi, Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Applied Mathematics, Discrete Mathematics and Combinatorics, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

International audience; 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).

Published
2022

3. Solving robust bin-packing problems with a branch-and-price approach

Author

André Rossi, Evgeny Gurevsky, Alexandre Dolgui, Xavier Schepler, Laboratoire d'Etudes et de Recherche en Informatique d'Angers (LERIA), Université d'Angers (UA), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), and IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)

Subjects
050210 logistics & transportation, Mathematical optimization, 021103 operations research, Information Systems and Management, General Computer Science, Bin packing problem, Computer science, Branch and price, 05 social sciences, 0211 other engineering and technologies, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Management Science and Operations Research, Industrial and Manufacturing Engineering, Bin, Stability radius, Robustness (computer science), Modeling and Simulation, Norm (mathematics), 0502 economics and business, Column generation, Relaxation (approximation), ComputingMilieux_MISCELLANEOUS
Abstract

One-dimensional bin-packing is a well-known combinatorial optimization problem which is strongly NP-hard. It consists of allocating a given set of items of different sizes into bins of the same capacity to minimize the number of bins used. The capacity of each bin cannot be exceeded. This paper deals with some variants of this problem to take into account the cases when there are items with uncertain sizes. The goal is to obtain robust solutions taking into account possible variations of item sizes around their nominal values. First, two robust approaches are considered which are based on a stability radius calculation, to ensure that the stability radius, measured either with the Manhattan or Chebyshev norm, is not below a given threshold. Then, a complementary robust approach is applied which is based on a relative resiliency calculation. To solve to optimality these robust variants of the bin-packing problem, a compact 0-1 linear programming formulation, which is also valid for the standard bin-packing problem, is introduced. Then, a Dantzig-Wolfe decomposition is suggested in order to provide a set-cover reformulation with a stronger linear relaxation, but an exponential number of columns. Finally, to obtain integer optimal solutions, a branch-and-price algorithm is developed, whose linear relaxation of the set-cover formulation is solved by a dynamic column generation. Numerical experiments are conducted on adapted benchmark sets from the literature. The performance of the branch-and-price algorithm allows us to investigate what protection against uncertainty is offered by each approach, and at which cost of robustness.

Published
2022

4. Optimizing task reassignments for reconfigurable multi-model assembly lines with unknown order of product arrival

Author

David Tremblet, Abdelkrim R. Yelles-Chaouche, Evgeny Gurevsky, Nadjib Brahimi, Alexandre Dolgui, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT), ESC Rennes School of Business, and ESC Rennes School of Business (ESC [Rennes])

Subjects
Hardware and Architecture, Control and Systems Engineering, [INFO]Computer Science [cs], Industrial and Manufacturing Engineering, Software
Abstract

International audience

Published
2023

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

Author

Alexandre Dolgui, Aleksandr Pirogov, André Rossi, Evgeny Gurevsky, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Université de Nantes - Faculté des Sciences et des Techniques, and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - Faculté des Sciences et des Techniques

Subjects
050210 logistics & transportation, Mathematical optimization, 021103 operations research, Information Systems and Management, Optimization problem, General Computer Science, Linear programming, Computer science, Heuristic, 05 social sciences, 0211 other engineering and technologies, Transfer line, Robust optimization, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Management Science and Operations Research, Chebyshev filter, Industrial and Manufacturing Engineering, Robustness (computer science), Modeling and Simulation, 0502 economics and business, Heuristics, ComputingMilieux_MISCELLANEOUS
Abstract

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.

Published
2021

8. Min‐sum controllable risk problems with concave risk functions of the same value range

Author

Evgeny Gurevsky, Mikhail Y. Kovalyov, Sergey Kovalev, Dmitry Kopelevich, Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), and Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
021103 operations research, Computer Networks and Communications, Computer science, 0211 other engineering and technologies, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 010201 computation theory & mathematics, Hardware and Architecture, Knapsack problem, Bicriteria optimization, Range (statistics), Applied mathematics, Value (mathematics), ComputingMilieux_MISCELLANEOUS, Software, Information Systems
Abstract

International audience

Published
2021

9. Min-max controllable risk problems

Author

Evgeny Gurevsky, Sergey Kovalev, Mikhail Y. Kovalyov, Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - Faculté des Sciences et des Techniques, Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - Faculté des Sciences et des Techniques, Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS), and Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST)

Subjects
021103 operations research, Spanning tree, Computer science, Multigraph, 0211 other engineering and technologies, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 0102 computer and information sciences, 02 engineering and technology, Management Science and Operations Research, 01 natural sciences, Theoretical Computer Science, Management Information Systems, Combinatorics, Computational Theory and Mathematics, 010201 computation theory & mathematics, Simple (abstract algebra), TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Shortest path problem, ComputingMilieux_MISCELLANEOUS, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

A min-max controllable risk problem, defined on combinatorial structures which are either simple paths of a directed multigraph or spanning trees of an undirected multigraph, with resource dependent risk functions of the arcs or the edges, is studied. The resource amount is limited, and the objective is to distribute it between the arcs or the edges so that the maximum risk over the arcs of a simple path or the edges of a spanning tree is minimized. Two new solution approaches are presented, which are asymptotically faster than the solution approaches suggested in the literature.

Published
2020

10. Minimizing task reassignments under balancing multi-product reconfigurable manufacturing lines

Author

Abdelkrim R. Yelles-Chaouche, Evgeny Gurevsky, Nadjib Brahimi, Alexandre Dolgui, Nantes Université -Institut de Recherche Technologique Jules Verne (Nantes Univ - IRT), Nantes Université (Nantes Univ), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), ESC Rennes School of Business (ESC [Rennes]), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
General Computer Science, General Engineering, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Abstract

International audience

Published
2022

11. Minimizing task reassignments in the design of reconfigurable manufacturing lines with space restrictions

Author

Evgeny Gurevsky, Alexandre Dolgui, Abdelkrim R. Yelles-Chaouche, Nadjib Brahimi, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Nantes (ECN)-Université de Nantes - Faculté des Sciences et des Techniques, Université de Nantes (UN)-Université de Nantes (UN)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Nantes (ECN)-Université de Nantes - Faculté des Sciences et des Techniques, Institut de Recherche Technologique Jules Verne [Bouguenais] (IRT Jules Verne), IRT Jules Vernes, ESC Rennes School of Business, Université de Nantes - Faculté des Sciences et des Techniques, Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - Faculté des Sciences et des Techniques, Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST)

Subjects
0209 industrial biotechnology, Mathematical optimization, Linear programming, Computer science, 020208 electrical & electronic engineering, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Solver, Space (commercial competition), Set (abstract data type), Task (computing), 020901 industrial engineering & automation, Control and Systems Engineering, Product (mathematics), Line (geometry), 0202 electrical engineering, electronic engineering, information engineering, Manufacturing line, ComputingMilieux_MISCELLANEOUS
Abstract

This paper deals with the design of a reconfigurable manufacturing line able to produce multiple products belonging to a same family. The aim is to generate for each product an appropriate line configuration subject to a given set of constraints so as to minimize the number of reassigned tasks when switching from one configuration to another. For this purpose, a mixed-integer linear programming (MILP) model is developed and tested on two categories of instances with 20 and 50 tasks respectively using a commercial solver. The obtained results show the efficiency (in terms of CPU and GAP) of the proposed MILP model to handle the first category of instances. However, it finds its limits to tackle the second category of instances.

Published
2020

12. A literature review of optimization problems for reconfigurable manufacturing systems

Author

Evgeny Gurevsky, Alexandre Dolgui, Abdelkrim R. Yelles-Chaouche, Nadjib Brahimi, ESC Rennes School of Business, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), and IRT Jules Vernes

Subjects
0209 industrial biotechnology, Optimization problem, Computer science, 020208 electrical & electronic engineering, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Manufacturing systems, Industrial engineering, Domain (software engineering), 020901 industrial engineering & automation, Work (electrical), Control and Systems Engineering, 0202 electrical engineering, electronic engineering, information engineering, ComputingMilieux_MISCELLANEOUS
Abstract

This paper is a literature review focusing on optimization problems for reconfigurable manufacturing systems (RMS). The literature is classified in two manners. In the first classification, different optimization problems rising in RMS are provided and discussed. The second one presents solution approaches used to solve these problems. This work is intended to help scientists identify potential research areas in the domain of optimization for RMS.

Published
2019

13. Robust balancing of straight assembly lines with interval task times

Author

Alexandre Dolgui, Evgeny Gurevsky, Öncü Hazır, and Olga Battaïa

Subjects
Marketing, Mathematical optimization, 021103 operations research, Branch and bound, Computer science, Strategy and Management, 0211 other engineering and technologies, Robust optimization, 02 engineering and technology, Interval (mathematics), Management Science and Operations Research, Management Information Systems, Task (project management), 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), 020201 artificial intelligence & image processing, Hedge (finance)
Abstract

This paper addresses the balancing problem for straight assembly lines where task times are not known exactly but given by intervals of their possible values. The objective is to assign the tasks to workstations minimizing the number of workstations while respecting precedence and cycle-time constraints. An adaptable robust optimization model is proposed to hedge against the worst-case scenario for task times. To find the optimal solution(s), a breadth-first search procedure is developed and evaluated on benchmark instances. The results obtained are analysed and some practical recommendations are given.

Published
2013

14. Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations

Author

Evgeny Gurevsky, Olga Battaïa, Alexandre Dolgui, André Rossi, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Centrale de Nantes (FRANCE), Ecole des Mines de Nantes (FRANCE), Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE), Université de Nantes (FRANCE), Université Nantes Angers Le Mans - UNAM (FRANCE), Université d'Angers (FRANCE), Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN), Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (Polytech Nantes), Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS), Mines Nantes (Mines Nantes), and Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN)

Subjects
0209 industrial biotechnology, Mathematical optimization, Optimization problem, Workstation, Linear programming, Computer science, 0211 other engineering and technologies, 02 engineering and technology, Maximal amplitude, Upper and lower bounds, law.invention, Cycle time, 020901 industrial engineering & automation, Sensitivity, law, Robustness (computer science), Discrete Mathematics and Combinatorics, Robustness, ComputingMilieux_MISCELLANEOUS, MILP, 021103 operations research, Applied Mathematics, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Assembly line design/balancing, Stability radius, Recherche opérationnelle, Task time variability
Abstract

This paper deals with an optimization problem that arises when a new paced simple assembly line has to be designed subject to a limited number of available workstations, cycle time constraint, and precedence relations between necessary assembly tasks. The studied problem, referred to as SALPB-S, consists in assigning the set of tasks to workstations so as to find the most robust line configuration (or solution) under task time variability. The robustness of solution is measured via its stability radius, i.e., as the maximal amplitude of deviations for task time nominal values that do not violate the solution feasibility. In this work, the concept of stability radius is considered for two well-known norms: ? 1 and ? ∞ . 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, an upper bound on the stability radius is devised and integrated into the corresponding MILP. 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.

Published
2016

15. Post-optimal analysis for a design problem of machining lines

Author

Evgeny Gurevsky, Alexandre Dolgui, Olga Guschinskaya, Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), and Gurevsky, Evgeny

Subjects
0209 industrial biotechnology, Mathematical optimization, Engineering, 021103 operations research, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], business.industry, 0211 other engineering and technologies, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Set (abstract data type), 020901 industrial engineering & automation, Machining, Combinatorial optimization, Line (text file), business, ComputingMilieux_MISCELLANEOUS
Abstract

The considered design problem aims to assign a given set of machining operations to a number of machines while minimizing the total line cost and respecting a number of given technological and economical constraints. In this paper the post-optimal analysis is presented, which studies the behavior of optimal (feasible) solutions under small changes in the input data taken into account by this design problem.

Published
2010

17. Equipment location in machining transfer lines with multi-spindle heads

Author

Evgeny Gurevsky, Alexandre Dolgui, Olga Battaïa, Fatme Makssoud, Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
0209 industrial biotechnology, 021103 operations research, Workstation, Computer science, Applied Mathematics, 0211 other engineering and technologies, Order (ring theory), 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Topology, Upper and lower bounds, law.invention, 020901 industrial engineering & automation, Machining, law, Modeling and Simulation, Transfer (computing), Line (geometry), ComputingMilieux_MISCELLANEOUS
Abstract

The considered problem appears when a machining line must be configured. It is necessary to define the number of workstations and the number of spindle heads at each workstation to be put in the line in order to produce a given part. This problem is known to be \(\mathcal{NP}\)-hard and, as a consequence, the solution time increases exponentially with the size of the problem. A number of pre-processing procedures are suggested in this article in order to decrease the initial problem size and thus shorten the solution time. A new algorithm for calculating a lower bound on the number of required equipment is also presented. A numerical example is given.

Published
2013

18. Balancing of simple assembly lines under variations of task processing times

Author

Evgeny Gurevsky, Olga Battaïa, Alexandre Dolgui, Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
0209 industrial biotechnology, Mathematical optimization, 021103 operations research, Heuristic, Computer science, 0211 other engineering and technologies, Stability (learning theory), General Decision Sciences, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Measure (mathematics), Set (abstract data type), Task (computing), 020901 industrial engineering & automation, Simple (abstract algebra), Product (mathematics), Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

One of the simple assembly line balancing problems (SALBPs), known as SALBP-E, is considered. It consists in assigning a given set V={1,2,…,n} of elementary tasks to linearly ordered workstations with respect to precedence and capacity restrictions while minimizing the following product: number of used workstations × working time on the most loaded one. The stability of feasible and optimal solutions for this problem with regard to possible variations of the processing time of certain tasks is investigated. Two heuristic procedures finding a compromise between the efficiency and the considered stability measure of studied solutions are suggested and evaluated on known benchmarks.

Published
2012

19. Metaheuristic approaches for the design of machining lines

Author

Olga Guschinskaya, Anton V. Eremeev, Alexandre Dolgui, Evgeny Gurevsky, Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
0209 industrial biotechnology, Engineering, Mathematical optimization, 021103 operations research, Optimization problem, business.industry, Mechanical Engineering, GRASP, 0211 other engineering and technologies, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Industrial and Manufacturing Engineering, Tabu search, Computer Science Applications, 020901 industrial engineering & automation, Machining, Control and Systems Engineering, Line (geometry), Genetic algorithm, business, Metaheuristic, Software, Greedy randomized adaptive search procedure, ComputingMilieux_MISCELLANEOUS
Abstract

The considered optimization problem deals with the design of the machine equipment used in a serial paced line. The cost and effectiveness of such a line depend on this decision. The investment cost can be reduced by optimizing the assignment of machining operations to the pieces of equipment. In this paper, new powerful metaheuristic methods applying the principles of a greedy randomized adaptive search procedure and a genetic algorithm are suggested for this problem. These methods are evaluated on a series of benchmarks and real industrial problems.

Published
2011

20. Balancing Mass Production Machining Lines with Genetic Algorithms

Author

Evgeny Gurevsky, Anton V. Eremeev, Olga Guschinskaya, and Alexandre Dolgui

Subjects
Set (abstract data type), Mathematical optimization, Operations research, Series (mathematics), Machining, Computer science, Line (geometry), Production (economics), Numerical tests
Abstract

A balancing problem for serial machining lines with multi-spindle heads is studied. The objective is to assign a set of given machining operations to a number of machines while minimizing the line cost and respecting a number of given technological and economical constraints. To solve this problem, three different genetic algorithms are suggested and compared via a series of numerical tests. The results of computational experiments are presented and analyzed.

Published
2010

21. Qualitative stability analysis of an optimal balance for an assembly line with fixed stations number

Author

Alexandre Dolgui, Evgeny Gurevsky, and Olga Guschinskaya

Subjects
Balance (metaphysics), Set (abstract data type), Discrete mathematics, Engineering, Operations research, Simple (abstract algebra), business.industry, Stability (learning theory), Algorithm design, Line (text file), Assembly line, Focus (optics), business
Abstract

We focus on one of the simple assembly line balancing problems known as SALBP-2 which consists in assigning a set of elementary operations V = {1, 2, … , n} to the m linearly ordered stations with respect to the precedence constraints and aims in minimizing the line cycle time c. The processing times of operations t j , j ∈ V may vary during the life cycle of assembly line for manual operations (represented by set V ) and be fixed for automated operations (set V ∖ V ). The goal of this paper is to derive necessary and sufficient condition (so-called qualitative analysis) of the stability of an optimal balance found for a given vector of operations times t = (t1, t2, … , t n ) with regard to possible independent perturbations of the processing times of the operations from set .

Published
2009

22. Balancing machining transfer lines using genetic algorithms

Author

Olga Guschinskaya, Evgeny Gurevsky, Anton V. Eremeev, Alexandre Dolgui, Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Gurevsky, Evgeny, IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), and Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Mathematical optimization, Engineering, 021103 operations research, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], business.industry, 0211 other engineering and technologies, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Cost reduction, 020901 industrial engineering & automation, Machining, Genetic algorithm, Line balancing, Optimization methods, Algorithm design, Assembly line, business, ComputingMilieux_MISCELLANEOUS
Abstract

A balancing problem for machining transfer lines is considered. The objective is to assign a set of given machining operations to a number of multi-spindle machines while minimizing the line cost and respecting a number of given technological and economical constraints. In comparison with the well-studied Assembly Line Balancing Problem, a number of additional constraints involved with machining environment are taken into account, for example, non-strict precedence constraints and parallel operations performing. To solve this problem, a two different genetic algorithms are suggested and compared on several sets of randomly generated and industrial problems. The results of computational experiments are presented and analyzed.

Catalog

Books, media, physical & digital resources
See catalog results