N
Nikolay Tchernev
Researcher at University of Auvergne
Publications - 91
Citations - 1052
Nikolay Tchernev is an academic researcher from University of Auvergne. The author has contributed to research in topics: Job shop & Job shop scheduling. The author has an hindex of 15, co-authored 83 publications receiving 895 citations. Previous affiliations of Nikolay Tchernev include Blaise Pascal University & Centre national de la recherche scientifique.
Papers
More filters
Journal ArticleDOI
Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles
TL;DR: A framework based on a disjunctive graph to modelize the joint scheduling problem and on a memetic algorithm for machines and AGVs scheduling is introduced to minimize the makespan.
Journal ArticleDOI
A combined financial and physical flows evaluation for logistic process and tactical production planning: Application in a company supply chain
Mickael Comelli,Mickael Comelli,Pierre Fenies,Pierre Fenies,Nikolay Tchernev,Nikolay Tchernev +5 more
TL;DR: This paper proposes to implement Activity Based Costing (ABC), cost drivers, and payment terms in order to estimate cash flow created by supply chain tactical production planning.
Journal ArticleDOI
A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles
TL;DR: In this article, the authors address the problem of simultaneous scheduling of machines and vehicles in flexible manufacturing systems, where the jobs have to be transported between the machines by automatic guided vehicles.
Journal ArticleDOI
An MILP for scheduling problems in an FMS with one vehicle
TL;DR: This linear formulation differs from the previously published ones as it takes into account the maximum number of jobs allowed in the system, limited input/output buffer capacities, empty vehicle trips and no-move-ahead trips simultaneously.
Journal ArticleDOI
A memetic algorithm for the job-shop with time-lags
TL;DR: A framework based on a disjunctive graph to modelize the problem and on a memetic algorithm for job sequence generation on machines to provide also a framework to cover both job-shop and flow-shop problem and to encompass both no-wait and classical instances.