Fabio Salassa

39 papers B 1C 1Journal 33Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
A note on "Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers".
Comput. Oper. Res.
Andrea Grosso, Fabio Salassa
2025 J jnl
Branch-and-bound-and-memorize for the blocking permutation flowshop problem.
Optim. Lett.
Roberto Bargetto, Fabio Salassa
2025 J jnl
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server.
Comput. Oper. Res.
Alessandro Druetto, Andrea Grosso, Jully Jeunet, Fabio Salassa
2025 J jnl
Exact approaches for parallel machine scheduling with loading and unloading servers.
Comput. Ind. Eng.
Alessandro Druetto, Andrea Grosso, Jully Jeunet, Fabio Salassa, Enrico Chiaramello
2025 J jnl
Single machine rescheduling for new orders with maximum and total time disruption constraints.
J. Sched.
Elena Rener, Fabio Salassa, Vincent T'kindt
2023 J jnl
Permutation flowshop problems minimizing core waiting time and core idle time.
Comput. Ind. Eng.
Arianna Alfieri, Michele Garraffa, Erica Pastore, Fabio Salassa
2023 J jnl
Single machine rescheduling for new orders: properties and complexity results.
CoRR
Elena Rener, Fabio Salassa, Vincent T'kindt
2023 J jnl
The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations.
Int. J. Prod. Res.
Jully Jeunet, Fabio Salassa
2022 J jnl
Exact solution of the two-machine flow shop problem with three operations.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa, Vincent T'kindt
2022 J jnl
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem.
Comput. Oper. Res.
Andrea Balogh, Michele Garraffa, Barry O'Sullivan, Fabio Salassa
2022 J jnl
Single machine rescheduling for new orders with maximum lateness minimization.
Comput. Oper. Res.
Elena Rener, Fabio Salassa, Vincent T'kindt
2021 J jnl
Column generation for minimizing total completion time in a parallel-batching environment.
J. Sched.
Arianna Alfieri, Alessandro Druetto, Andrea Grosso, Fabio Salassa
2021 — conf
Evaluating the Deployment of Collaborative Logistics Models for Local Delivery Services.
APMS (4)
Andrea Bari, Fabio Salassa, Maurizio Arnone, Tiziana Delmastro
2021 J jnl
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs.
Comput. Oper. Res.
Jully Jeunet, Federico Della Croce, Fabio Salassa
2021 J jnl
Merging combinatorial design and optimization: the Oberwolfach problem.
Australas. J Comb.
Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce
2021 J jnl
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem.
J. Heuristics
Federico Della Croce, Andrea Grosso, Fabio Salassa
2019 J jnl
A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids.
IEEE Internet Things J.
Luca Barbierato, Abouzar Estebsari, Enrico Pons, Marco Pau, Fabio Salassa, Marco Ghirardi, Edoardo Patti
2019 J jnl
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths.
J. Sched.
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt
2017 J jnl
A new exact approach for the 0-1 Collapsing Knapsack Problem.
Eur. J. Oper. Res.
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
2017 J jnl
An exact approach for the 0-1 knapsack problem with setups.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
2017 J jnl
An exact semidefinite programming approach for the max-mean dispersion problem.
J. Comb. Optim.
Michele Garraffa, Federico Della Croce, Fabio Salassa
2017 J jnl
Heuristic approaches for a domestic energy management system.
Comput. Ind. Eng.
Federico Della Croce, Michele Garraffa, Fabio Salassa, Claudio Borean, Giuseppe Di Bella, Ennio Grasso
2017 J jnl
Local and global constraint consistency in personnel rostering.
Int. Trans. Oper. Res.
Pieter Smet, Fabio Salassa, Greet Vanden Berghe
2017 J jnl
MILP and Max-Clique based heuristics for the Eternity II puzzle.
CoRR
Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe
2017 J jnl
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths.
CoRR
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt
2016 J jnl
A hybrid three-phase approach for the Max-Mean Dispersion Problem.
Comput. Oper. Res.
Federico Della Croce, Michele Garraffa, Fabio Salassa
2016 J jnl
Searching for a cycle with maximum coverage in undirected graphs.
Optim. Lett.
Andrea Grosso, Fabio Salassa, Wim Vancroonenburg
2016 J jnl
The one-dimensional cutting stock problem with sequence-dependent cut losses.
Int. Trans. Oper. Res.
Michele Garraffa, Fabio Salassa, Wim Vancroonenburg, Greet Vanden Berghe, Tony Wauters
2015 J jnl
An Integrated System to Acquire Knowledge and Support Decisions in Complex Innovation Design Processes.
J. Organ. Comput. Electron. Commer.
Maria Franca Norese, Chiara Novello, Fabio Salassa
2014 C conf
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem.
ISCO
Federico Della Croce, Michele Garraffa, Fabio Salassa
2014 J jnl
A hybrid heuristic approach for single machine scheduling with release times.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa, Vincent T'kindt
2014 J jnl
A matheuristic approach for the two-machine total completion time flow shop problem.
Ann. Oper. Res.
Federico Della Croce, Andrea Grosso, Fabio Salassa
2014 J jnl
A variable neighborhood search based matheuristic for nurse rostering problems.
Ann. Oper. Res.
Federico Della Croce, Fabio Salassa
2012 — conf
A System To Integrate Unstructured And Semistructured Information Resources: An Application In An Innovation Design Process.
DSS
Maria Franca Norese, Chiara Novello, Fabio Salassa
2012 J jnl
Improved LP-based algorithms for the closest string problem.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa
2012 J jnl
Matheuristics for combinatorial optimization problems: applications to services and production systems.
4OR
Fabio Salassa
2011 B conf
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem.
EvoCOP
Federico Della Croce, Andrea Grosso, Fabio Salassa
2011 — —
Matheuristics for Combinatorial Optimization Problems:Applications to Services and Production Systems.
Fabio Salassa
2010 — conf
A System to Analyse Interviews and Structure the Acquired Knowledge Elements.
DSS
Maria Franca Norese, Fabio Salassa