default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolay Tchernev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Nicolas Cheimanoff, Pierre Féniès, Mohamed Nour Kitri, Nikolay Tchernev:
A Disjunctive Graph Solution Representation for the Continuous and Dynamic Berth Allocation Problem. MIC (2) 2024: 204-218- 2023
- [j17]Meryem Bamoumen
, Selwa Elfirdoussi, Libo Ren, Nikolay Tchernev:
An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem. Comput. Oper. Res. 150: 106082 (2023) - [j16]Nicolas Cheimanoff, Pierre Féniès, Mohamed Nour Kitri, Nikolay Tchernev:
Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem. Comput. Oper. Res. 153: 106174 (2023) - 2022
- [j15]Nicolas Cheimanoff, Frédéric Fontane, Mohamed Nour Kitri, Nikolay Tchernev:
Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems. Comput. Oper. Res. 141: 105695 (2022) - [j14]Nicolas Cheimanoff, Frédéric Fontane, Mohamed Nour Kitri, Nikolay Tchernev:
Exact and heuristic methods for the berth allocation problem with multiple continuous quays in tidal bulk terminals. Expert Syst. Appl. 201: 117141 (2022) - [j13]Eric Bourreau, Thierry Garaix, Matthieu Gondran, Philippe Lacomme, Nikolay Tchernev:
A constraint-programming based decomposition method for the Generalised Workforce Scheduling and Routing Problem (GWSRP). Int. J. Prod. Res. 60(4): 1265-1283 (2022) - 2021
- [j12]Nicolas Cheimanoff, Frédéric Fontane, Mohamed Nour Kitri, Nikolay Tchernev:
A reduced VNS based approach for the dynamic continuous berth allocation problem in bulk terminals with tidal constraints. Expert Syst. Appl. 168: 114215 (2021) - [c12]Ivan Peña-Arenas, Thierry Garaix, Philippe Lacomme, Nikolay Tchernev:
A mixed integer programming formulation for the truck drivers scheduling problem considering the European Union drivers rules. CASE 2021: 101-106 - [c11]Meryem Bamoumen, Selwa Elfirdoussi, Libo Ren, Nikolay Tchernev:
A MILP Model for the Scheduling of a Multiproduct Tree-Structure Pipeline Network in Mining Industry. APMS (3) 2021: 299-306 - 2020
- [j11]Matthieu Gondran, Sylverin Kemmoe Tchomte, Damien Lamy, Nikolay Tchernev:
Bi-objective optimisation approaches to Job-shop problem with power requirements. Expert Syst. Appl. 162: 113753 (2020) - [j10]Benjamin Vincent, Christophe Duhamel, Libo Ren, Nikolay Tchernev:
A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines. Int. J. Prod. Res. 58(21): 6689-6706 (2020)
2010 – 2019
- 2018
- [j9]Matthieu Gondran, Marie-José Huguet, Philippe Lacomme, Alain Quilliot, Nikolay Tchernev:
A Dial-a-Ride evaluation for solving the job-shop with routing considerations. Eng. Appl. Artif. Intell. 74: 70-89 (2018) - 2017
- [j8]Sylverin Kemmoe Tchomte, Damien Lamy, Nikolay Tchernev:
An effective multi-start multi-level evolutionary local search for the flexible job-shop problem. Eng. Appl. Artif. Intell. 62: 80-95 (2017) - [j7]Sylverin Kemmoe Tchomte, Damien Lamy, Nikolay Tchernev:
Job-shop like manufacturing system with variable power threshold and operations with power requirements. Int. J. Prod. Res. 55(20): 6011-6032 (2017) - 2015
- [c10]Sylverin Kemmoe Tchomte, Damien Lamy, Nikolay Tchernev:
An Optimization Approach for Job-shop with Financial Constraints - In the Context of Supply Chain Scheduling Considering Payment Delay between Members. ICORES 2015: 190-198 - [c9]Sylverin Kemmoe Tchomte, Damien Lamy, Nikolay Tchernev:
Job-Shop like Manufacturing System with Time Dependent Energy Threshold and Operations with Peak Consumption. APMS (1) 2015: 617-624 - 2014
- [j6]Maxime Chassaing, Jonathan Fontanel, Philippe Lacomme, Libo Ren, Nikolay Tchernev, Pierre Villechenon:
A GRASP × ELS approach for the job-shop with a web service paradigm packaging. Expert Syst. Appl. 41(2): 544-562 (2014) - [c8]Philippe Lacomme, Libo Ren, Nikolay Tchernev, Benjamin Vincent:
Shortest Path Challenging Problem - Context of Mobile Devices in Urban Area Considering Weakened GPS Signal and Data Network Traffic. ICORES 2014: 393-400 - [c7]Sylverin Kemmoe Tchomte, Nikolay Tchernev:
A GRASPxELS for Scheduling of Job-Shop Like Manufacturing Systems and CO2 Emission Reduction. APMS (2) 2014: 130-137 - 2011
- [c6]Philippe Lacomme, Nikolay Tchernev, Marie-José Huguet:
Dedicated constraint propagation for Job-Shop problem with generic time-lags. ETFA 2011: 1-7
2000 – 2009
- 2009
- [j5]Anthony Caumond, Philippe Lacomme, Aziz Moukrim, Nikolay Tchernev:
An MILP for scheduling problems in an FMS with one vehicle. Eur. J. Oper. Res. 199(3): 706-722 (2009) - [j4]James A. Rappold, Nikolay Tchernev:
Special Issue on Supply Chain Design. Eur. J. Oper. Res. 199(3): 732-733 (2009) - 2008
- [j3]Anthony Caumond, Philippe Lacomme, Nikolay Tchernev:
A memetic algorithm for the job-shop with time-lags. Comput. Oper. Res. 35(7): 2331-2356 (2008) - 2006
- [j2]Abdelhakim Artiba, Nikolay Tchernev:
Editorial. Int. J. Comput. Integr. Manuf. 19(3): 195-196 (2006) - [j1]Michelle Chabrol, Pierre Féniès, Michel Gourgand, Nikolay Tchernev:
Un environnement de modélisation pour le système d'information de la Supply Chain. Application au Nouvel Hôpital Estaing. Ingénierie des Systèmes d Inf. 11(1): 137-162 (2006) - 2005
- [c5]Michelle Chabrol, Pierre Féniès, Michel Gourgand, Nikolay Tchernev:
Un environnement de modélisation pour le système d'information de la Supply Chain: application au Nouvel Hôpital d'Estaing. INFORSID 2005: 603-618 - 2001
- [c4]Laurent Deroussi, Michel Gourgand, Nikolay Tchernev:
Coupling local search methods and simulated annealing to the job shop scheduling problem with transportation. ETFA (1) 2001: 659-667 - 2000
- [c3]Michelle Chabrol, David Sarramia, Nikolay Tchernev:
Object oriented methodology for urban traffic modelling and simulation. ESM 2000: 246-250 - [c2]Michel Gourgand, Alain Tanguy, Nikolay Tchernev:
A generic hybrid flow-shop simulation model using SIMULA. ESM 2000: 307-312 - [c1]Michel Gourgand, Philippe Lacomme, Nikolay Tchernev:
Simulation based scheduling with WIP consideration for FMS using trip-based material handling systems. ESM 2000: 481-488
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-28 23:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
