Nikolay Tchernev

Dr. Nikolay Tchernev

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2021 in Expert Systems with Applications
Verified
Journal Article
Closed access
NCNicolas Cheimanoff
Nicolas Cheimanoff
FFFrédéric Fontane
Frédéric Fontane
MKMohamed Nour Kitri
Mohamed Nour Kitri
NTNikolay Tchernev
Nikolay Tchernev

2 February 2023 in Computers & Operations Research
Verified
Journal Article
Closed access
NCNicolas Cheimanoff
Nicolas Cheimanoff
PFPierre Féniès
Pierre Féniès
MKMohamed Nour Kitri
Mohamed Nour Kitri
NTNikolay Tchernev
Nikolay Tchernev

4 April 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
NCNicolas Cheimanoff
Nicolas Cheimanoff
FFFrédéric Fontane
Frédéric Fontane
MKMohamed Nour Kitri
Mohamed Nour Kitri
NTNikolay Tchernev
Nikolay Tchernev

3 June 2013 in International Journal of Production Research
Verified
Journal Article
Closed access
SKSylverin Kemmoe
Sylverin Kemmoe
PPPierre-Alban Pernot
Pierre-Alban Pernot
NTNikolay Tchernev
Nikolay Tchernev
In response to market pressures, manufacturers have adopted different approaches to provide flexibility regarding several aspects. In this paper, we suggest a model for the evaluation of the flexibility of the manufacturing supply chain, based on graph theory techniques. This model defines maximum excess demand that may be met using flexibility. Recourse to flexibility enablers is determined based on cost minimisation. Such enablers are volume flexibility, mix flexibility and safety stocks. The proposed model is solved using a two-step Mix Integer Linear Programme; the first step consists in defining maximum demand that may be met while the second step concerns minimising cost. The main benefit of our model is to deal with realistic problems in a rather short time. Therefore, it can be used in a wide ‘what-if’ design process. It means evaluating various contemplated flexibility configurations in multiple demand scenarios in order to choose the best option. It can be also used during operational supply chain planning in order to face to an unbalanced situation. This paper ends with a numerical example illustrating our model’s efficiency.

16 November 2022 in Computers & Operations Research
Verified
Journal Article
Closed access
MBMeryem Bamoumen
Meryem Bamoumen
SESelwa ELFIRDOUSSI
Selwa ELFIRDOUSSI
LRLibo Ren
Libo Ren
NTNikolay Tchernev
Nikolay Tchernev

7 January 2020 in International Journal of Production Research
Verified
Journal Article
Closed access
BVBenjamin Vincent
Benjamin Vincent
CDChristophe Duhamel
Christophe Duhamel
LRLibo Ren
Libo Ren
NTNikolay Tchernev
Nikolay Tchernev
This paper deals with the capacitated lot-sizing problem with multiple items, setup time and unrelated parallel machines. The aim of the article is to propose an efficient population-based metaheuristic to tackle this problem. In the proposed approach, a dynamic constructive heuristic is proposed for generating a set of initial solutions. A path-relinking strategy between solutions in the current population is integrated in the diversification procedure, allowing us to explore the solution space further. The population is then intensified using a local search procedure which uses an operator based on machine capacity relaxation coupled with a repair procedure. The proposed approach is evaluated from the instances introduced in Toledo, F. M. B., and V. A. Armentano (2006.“A Lagrangian-Based Heuristic for the Capacitated Lot-Sizing Problem in Parallel Machines.” European Journal of Operational Research 175 (2): 1070–1083). The results of the experiment show that the proposed approach yields competitive results in terms of solution quality for most of the instances.