Nicolas Zufferey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Nicolas Zufferey has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
Jean Respen
Dootix Sàrl
4 shared publications- Marie-Sklaerder Vié
GSEM, University of Geneva - Uni Mail
4 shared publications Simon Thevenin
University of Geneva
4 shared publications- Olivier Gallay
University of Lausanne
3 shared publications Philippe Wieser
EPFL – École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
3 shared publications- Rachid Benmansour
SI2M Laboratory, INSEA, Rabat, Morocco
3 shared publications
Latest Publications
- 8 June 2026
- Published by Springer Nature in OR Spectrum
- p. 1-30
Solution methods for the two-machine blocking flow shop scheduling problem with position-based learning effect
- 8 June 2026
- Published by Springer Nature in OR Spectrum
- p. 1-30
Solution methods for the two-machine blocking flow shop scheduling problem with position-based learning effect
- 11 October 2025
- Published by Springer Nature
- p. 85-95
Intervention Planning for a Home Health-and-Social-Care Institute in Switzerland
- 11 October 2025
- Published by Springer Nature
- p. 85-95
Intervention Planning for a Home Health-and-Social-Care Institute in Switzerland
- Open Access
- 12 May 2025
- Published by Elsevier in Case Studies in Construction Materials
- Vol. 22
Bridge service life and impact of maintenance events on the structural state index
- 12 May 2025
- Published by Elsevier in Case Studies in Construction Materials
- Vol. 22
Open AccessBridge service life and impact of maintenance events on the structural state index
- Open Access
- 5 June 2024
- Published by Taylor & Francis in Supply Chain Forum: An International Journal
- Vol. 25 (3) , 308-320
Variable neighbourhood search for parallel machine scheduling with a single loading server: a truck-scheduling perspective
- 5 June 2024
- Published by Taylor & Francis in Supply Chain Forum: An International Journal
- Vol. 25 (3) , 308-320
Open AccessVariable neighbourhood search for parallel machine scheduling with a single loading server: a truck-scheduling perspective
- Open Access
- 17 May 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 355, 200-222
Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
- 17 May 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 355, 200-222
Open AccessGraph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
- 16 July 2023
- Published by Springer Nature
- p. 317-327
Reducing the Supply-Chain Nervosity Thanks to Flexible Planning
- 16 July 2023
- Published by Springer Nature
- p. 317-327
Reducing the Supply-Chain Nervosity Thanks to Flexible Planning
- Open Access
- 14 July 2023
- Published by Springer Nature in OR Spectrum
- Vol. 45 (4) , 1113-1151
A matheuristic for tactical locomotive and driver scheduling for the Swiss national railway company SBB Cargo AG
At the scale of Switzerland, the national railway company SBB Cargo AG has to schedule its locomotives and drivers in order to be able to pull all trains. Two objective functions are considered in a two-stage lexicographic fashion: (1) the locomotive and driver costs and (2) the driver time that is spent without driving. As the problem instances tend to reach really big sizes (up to 1900 trains), we propose to schedule locomotives and drivers in a sequential way, thus having a sequence of smaller problems to solve. Moreover, for smaller instances, we also propose to schedule jointly locomotives and drivers in an integrated way, therefore increasing the search space but possibly leading to better solutions. In this paper, we present a mathematical formulation and model for the problem. We also consider the contract-related constraints of the drivers, and we propose a way to integrate some time flexibility in the schedules. Next, we propose an innovative matheuristic to solve the problem, relying on a descent local search and a rolling horizon decomposition. An important goal of this method is to explore thoroughly at which extent a general-purpose solver can be used on this problem. Finally, the benefits of each aspect of the model and of the method are analyzed in detail on the results obtained for 20 real SBB Cargo AG instances.
- 14 July 2023
- Published by Springer Nature in OR Spectrum
- Vol. 45 (4) , 1113-1151
Open AccessA matheuristic for tactical locomotive and driver scheduling for the Swiss national railway company SBB Cargo AG
At the scale of Switzerland, the national railway company SBB Cargo AG has to schedule its locomotives and drivers in order to be able to pull all trains. Two objective functions are considered in a two-stage lexicographic fashion: (1) the locomotive and driver costs and (2) the driver time that is spent without driving. As the problem instances tend to reach really big sizes (up to 1900 trains), we propose to schedule locomotives and drivers in a sequential way, thus having a sequence of smaller problems to solve. Moreover, for smaller instances, we also propose to schedule jointly locomotives and drivers in an integrated way, therefore increasing the search space but possibly leading to better solutions. In this paper, we present a mathematical formulation and model for the problem. We also consider the contract-related constraints of the drivers, and we propose a way to integrate some time flexibility in the schedules. Next, we propose an innovative matheuristic to solve the problem, relying on a descent local search and a rolling horizon decomposition. An important goal of this method is to explore thoroughly at which extent a general-purpose solver can be used on this problem. Finally, the benefits of each aspect of the model and of the method are analyzed in detail on the results obtained for 20 real SBB Cargo AG instances.
- 4 September 2022
- Published by Springer Nature
- p. 17-28
Ant Algorithms: From Drawback Identification to Quality and Speed Improvement
- 4 September 2022
- Published by Springer Nature
- p. 17-28
Ant Algorithms: From Drawback Identification to Quality and Speed Improvement
- Open Access
- 4 April 2022
- Published by Springer Nature in Journal of Scheduling
- Vol. 25 (2) , 203-228
Aircraft landing planning under uncertain conditions
Aircraft Landing Planning is challenging because the inherently limited capacity of airport runways causes bottlenecks. This type of planning involves different stakeholders (e.g., airlines, air traffic services providers, airport authorities, and passengers) and faces various uncertainties (e.g., take-off time variability, or wind speeds). This study, conducted in collaboration with the European Organization for the Safety of Air Navigation (EUROCONTROL), proposes a mathematical formulation of the problem and a simulation framework that accounts for uncertainties. We also propose different solution methods: a descent and a tabu search, as well as a mechanism for guiding restarts, to diversify the search process. These methods provide, in our simulated environment, more effective and stable solutions than the popular first-come-first-served practice regarding three objective functions (namely, delay, fuel, and landing sequence stability), which are considered lexicographically. Indeed, the average delays and fuel costs are reduced by 50% and 10%, respectively, at the cost of a small number of landing-sequence modifications, as each flight is repositioned an average of 0.5 times. Moreover, the computations can be performed quickly, which is crucial because re-optimization needs to be done online when flight information is updated.
- 4 April 2022
- Published by Springer Nature in Journal of Scheduling
- Vol. 25 (2) , 203-228
Open AccessAircraft landing planning under uncertain conditions
Aircraft Landing Planning is challenging because the inherently limited capacity of airport runways causes bottlenecks. This type of planning involves different stakeholders (e.g., airlines, air traffic services providers, airport authorities, and passengers) and faces various uncertainties (e.g., take-off time variability, or wind speeds). This study, conducted in collaboration with the European Organization for the Safety of Air Navigation (EUROCONTROL), proposes a mathematical formulation of the problem and a simulation framework that accounts for uncertainties. We also propose different solution methods: a descent and a tabu search, as well as a mechanism for guiding restarts, to diversify the search process. These methods provide, in our simulated environment, more effective and stable solutions than the popular first-come-first-served practice regarding three objective functions (namely, delay, fuel, and landing sequence stability), which are considered lexicographically. Indeed, the average delays and fuel costs are reduced by 50% and 10%, respectively, at the cost of a small number of landing-sequence modifications, as each flight is repositioned an average of 0.5 times. Moreover, the computations can be performed quickly, which is crucial because re-optimization needs to be done online when flight information is updated.