default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Zufferey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j49]Abdelhak Elidrissi
, Rachid Benmansour, Nicolas Zufferey, Mohammed Benbrahim, David Duvivier:
Minimization of maximum lateness on parallel machines with a single server and job release dates. 4OR 22(3): 351-385 (2024)- [j48]Jocelin Cailloux, Nicolas Zufferey, Olivier Gallay:
Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context. Discret. Appl. Math. 355: 200-222 (2024) - [j47]Fan Yang, Ben Hermans, Nicolas Zufferey, Roel Leus:
Sequential testing in batches with resource constraints. Expert Syst. Appl. 256: 124858 (2024) - [j46]Khelil Kassoul, Naoufel Cheikhrouhou, Nicolas Zufferey:
Simultaneous allocation of buffer capacities and service times in unreliable production lines. Int. J. Prod. Res. 62(3): 644-664 (2024) - 2023
- [j45]Khelil Kassoul, Naoufel Cheikhrouhou, Nicolas Zufferey:
Adaptive Dynamic Jumping Particle Swarm Optimization for Buffer Allocation in Unreliable Production Lines. IEEE Access 11: 90410-90420 (2023) - [j44]Marie-Sklaerder Vié, Nicolas Zufferey, Stefan Minner:
A matheuristic for tactical locomotive and driver scheduling for the Swiss national railway company SBB Cargo AG. OR Spectr. 45(4): 1113-1151 (2023) - 2022
- [j43]Khelil Kassoul, Nicolas Zufferey, Naoufel Cheikhrouhou, Samir Brahim Belhaouari:
Exponential Particle Swarm Optimization for Global Optimization. IEEE Access 10: 78320-78344 (2022) - [j42]Khelil Kassoul, Naoufel Cheikhrouhou, Nicolas Zufferey:
Buffer allocation design for unreliable production lines using genetic algorithm and finite perturbation analysis. Int. J. Prod. Res. 60(10): 3001-3017 (2022) - [j41]Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier:
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. J. Sched. 25(1): 89-105 (2022) - [j40]Marie-Sklaerder Vié, Nicolas Zufferey, Roel Leus:
Aircraft landing planning under uncertain conditions. J. Sched. 25(2): 203-228 (2022) - 2021
- [j39]Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte:
Inbound and outbound flow integration for cross-docking operations. Eur. J. Oper. Res. 294(3): 1153-1163 (2021) - [j38]Dayan de C. Bissoli, Nicolas Zufferey, André Renato Sales Amaral:
Lexicographic optimization-based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem. Int. Trans. Oper. Res. 28(5): 2733-2758 (2021) - [j37]Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey:
Parcel delivery cost minimization with time window constraints using trucks and drones. Networks 78(4): 400-420 (2021) - 2020
- [j36]Simone Voldrich, Philippe Wieser, Nicolas Zufferey:
Design of a quality control network for an international food company. INFOR Inf. Syst. Oper. Res. 58(1): 1-16 (2020) - [j35]Simone Voldrich, Philippe Wieser, Nicolas Zufferey:
Optimizing the trade-off between performance measures and operational risk in a food supply chain environment. Soft Comput. 24(5): 3365-3378 (2020)
2010 – 2019
- 2019
- [j34]Abderrahmen Mediouni, Nicolas Zufferey, Nachiappan Subramanian, Naoufel Cheikhrouhou:
Fit between humanitarian professionals and project requirements: hybrid group decision procedure to reduce uncertainty in decision-making. Ann. Oper. Res. 283(1-2): 471-496 (2019) - [j33]Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte:
Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer. Comput. Oper. Res. 112 (2019) - [j32]Simon Thevenin, Nicolas Zufferey:
Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections. Discret. Appl. Math. 261: 344-353 (2019) - [j31]Marie-Sklaerder Vié, Nicolas Zufferey, Jean-François Cordeau:
Solving the Wire-Harness Design Problem at a European car manufacturer. Eur. J. Oper. Res. 272(2): 712-724 (2019) - [j30]Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey:
Vehicle routing with transportable resources: Using carpooling and walking for on-site services. Eur. J. Oper. Res. 279(3): 996-1010 (2019) - [j29]Jean Respen, Nicolas Zufferey, Jean-Yves Potvin:
Impact of vehicle tracking on a routing problem with dynamic travel times. RAIRO Oper. Res. 53(2): 401-414 (2019) - 2018
- [j28]Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin:
Graph multi-coloring for a job scheduling application. Discret. Appl. Math. 234: 218-235 (2018) - [c15]Marc-André Carle, Alain Martel, Nicolas Zufferey:
Collaborative Agent Teams (CAT): From the Paradigm to Implementation Guidelines. BIOMA 2018: 62-74 - [c14]Nicolas Zufferey, Olivier Gallay:
Collaborative Variable Neighborhood Search. BIOMA 2018: 320-332 - 2017
- [j27]Simon Thevenin, Nicolas Zufferey, Rémy Glardon:
Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions. Ann. Oper. Res. 259(1-2): 437-460 (2017) - [j26]Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin:
Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility. Int. J. Prod. Res. 55(6): 1588-1606 (2017) - [j25]Jean Respen, Nicolas Zufferey:
Metaheuristics for truck loading in the car production industry. Int. Trans. Oper. Res. 24(1-2): 277-301 (2017) - [j24]Jean Respen, Nicolas Zufferey, Philippe Wieser:
Three-level inventory deployment for a luxury watch company facing various perturbations. J. Oper. Res. Soc. 68(10): 1195-1210 (2017) - 2016
- [j23]Simon Thevenin, Nicolas Zufferey, Marino Widmer:
Order acceptance and scheduling with earliness and tardiness penalties. J. Heuristics 22(6): 849-890 (2016) - [j22]Malgorzata Michalska, Nicolas Zufferey, Marco Mattavelli:
Performance Estimation Based Multicriteria Partitioning Approach for Dynamic Dataflow Programs. J. Electr. Comput. Eng. 2016: 8536432:1-8536432:15 (2016) - [j21]Jean Respen, Nicolas Zufferey, Edoardo Amaldi:
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. Networks 67(3): 246-261 (2016) - [c13]Malgorzata Michalska, Nicolas Zufferey, Marco Mattavelli:
Tabu Search for Partitioning Dynamic Dataflow Programs. ICCS 2016: 1577-1588 - [c12]Nicolas Zufferey, Byung Yun Cho, Rémy Glardon:
Dynamic Multi-trip Vehicle Routing with Unusual Time-windows for the Pick-up of Blood Samples and Delivery of Medical Material. ICORES 2016: 366-372 - [c11]Malgorzata Michalska, Nicolas Zufferey, Endri Bezati, Marco Mattavelli:
Design Space Exploration Problem Formulation for Dataflow Programs on Heterogeneous Architectures. MCSoC 2016: 217-224 - 2015
- [j20]Nicolas Zufferey, Michel Vasquez:
A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems. RAIRO Oper. Res. 49(1): 99-121 (2015) - [j19]Simon Thevenin, Nicolas Zufferey, Marino Widmer:
Metaheuristics for a scheduling problem with rejection and tardiness penalties. J. Sched. 18(1): 89-105 (2015) - [c10]Nicolas Zufferey, Jaime Farres, Rémy Glardon:
Ant Metaheuristic with Adapted Personalities for the Vehicle Routing Problem. ICCL 2015: 3-15 - [c9]Nicolas Zufferey:
Graph Coloring Tabu Search for Project Scheduling. ICCSAMA 2015: 107-118 - [c8]Nicolas Zufferey:
Adaptive Memory Algorithm with the Covering Recombination Operator. MCO (2) 2015: 153-164 - 2014
- [c7]Nicolas Zufferey, David Schindl:
Learning Tabu Search for Combinatorial Optimization. ICORES (Selected Papers) 2014: 3-11 - [c6]Nicolas Zufferey:
Optimization by Unconventional Ant Algorithms. ICORES 2014: IS-5 - [c5]Nicolas Zufferey:
Design and Classification of Ant Metaheuristics. PDP 2014: 339-343 - 2013
- [j18]Ivo Blöchliger, Nicolas Zufferey:
Multi-coloring and job-scheduling with assignment and incompatibility costs. Ann. Oper. Res. 211(1): 83-101 (2013) - [j17]David Schindl, Nicolas Zufferey:
Solution Methods for Fuel Supply of Trains. INFOR Inf. Syst. Oper. Res. 51(1): 23-30 (2013) - [c4]Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin:
Tabu Search for a Preemptive Scheduling Problem with Job Incompatibilities. MIM 2013: 1590-1595 - 2012
- [j16]Nicolas Zufferey, Olivier Labarthe, David Schindl:
Heuristics for a project management problem with incompatibility and assignment costs. Comput. Optim. Appl. 51(3): 1231-1252 (2012) - [j15]Nicolas Zufferey:
Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. 6(5): 963-973 (2012) - [c3]Nicolas Zufferey:
Ant Local Search for Combinatorial Optimization. BIONETICS 2012: 223-236 - 2011
- [j14]Sandro Lorini, Jean-Yves Potvin, Nicolas Zufferey:
Online vehicle routing and scheduling with dynamic travel times. Comput. Oper. Res. 38(7): 1086-1090 (2011) - [j13]Houssam Amrani, Alain Martel, Nicolas Zufferey, Polina Makeeva:
A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations. OR Spectr. 33(4): 989-1007 (2011) - 2010
- [j12]François-Xavier Meuwly, Bernard Ries, Nicolas Zufferey:
Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints. Algorithmic Oper. Res. 5(2): 75-85 (2010) - [j11]Michel Bierlaire, M. Thémans, Nicolas Zufferey:
A Heuristic for Nonlinear Global Optimization. INFORMS J. Comput. 22(1): 59-70 (2010) - [j10]Matthieu Plumettaz, David Schindl, Nicolas Zufferey:
Ant Local Search and its efficient adaptation to graph colouring. J. Oper. Res. Soc. 61(5): 819-826 (2010)
2000 – 2009
- 2009
- [j9]Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey:
Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]. Discret. Appl. Math. 157(7): 1335-1336 (2009) - [j8]Alain Hertz, David Schindl, Nicolas Zufferey:
A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15(5): 425-450 (2009) - 2008
- [j7]Ivo Blöchliger, Nicolas Zufferey:
A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comput. Oper. Res. 35(3): 960-975 (2008) - [j6]Philippe Galinier, Alain Hertz, Nicolas Zufferey:
An adaptive memory algorithm for the k-coloring problem. Discret. Appl. Math. 156(2): 267-279 (2008) - [j5]Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey:
Variable space search for graph coloring. Discret. Appl. Math. 156(13): 2551-2560 (2008) - [j4]Sacha Varone, Nicolas Zufferey:
Three tabu search methods for the MI-FAP applied to 802.11 networks. RAIRO Oper. Res. 42(4): 501-514 (2008) - [j3]Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari:
Graph colouring approaches for a satellite range scheduling problem. J. Sched. 11(4): 263-277 (2008) - 2007
- [c2]Luc Luyet, Sacha Varone, Nicolas Zufferey:
An Ant Algorithm for the Steiner Tree Problem in Graphs. EvoWorkshops 2007: 42-51 - 2006
- [c1]Nicolas Zufferey, Martin Studer, Edward A. Silver:
Tabu Search for a Car Sequencing Problem. FLAIRS 2006: 457-462 - 2005
- [j2]Alain Hertz, David Schindl, Nicolas Zufferey:
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2): 139-161 (2005) - 2003
- [j1]Cédric Avanthay, Alain Hertz, Nicolas Zufferey:
A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151(2): 379-388 (2003)
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-10-07 22:21 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:
