Fabio Salassa

Orcid: 0000-0002-9698-6892

According to our database1, Fabio Salassa authored at least 34 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations.
Int. J. Prod. Res., August, 2023

Permutation flowshop problems minimizing core waiting time and core idle time.
Comput. Ind. Eng., February, 2023

Single machine rescheduling for new orders: properties and complexity results.
CoRR, 2023

2022
Single machine rescheduling for new orders with maximum lateness minimization.
Comput. Oper. Res., 2022

Exact solution of the two-machine flow shop problem with three operations.
Comput. Oper. Res., 2022

MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem.
Comput. Oper. Res., 2022

2021
Column generation for minimizing total completion time in a parallel-batching environment.
J. Sched., 2021

Minimizing total completion time in the two-machine no-idle no-wait flow shop problem.
J. Heuristics, 2021

Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs.
Comput. Oper. Res., 2021

Merging combinatorial design and optimization: the Oberwolfach problem.
Australas. J Comb., 2021

Evaluating the Deployment of Collaborative Logistics Models for Local Delivery Services.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

2019
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths.
J. Sched., 2019

A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids.
IEEE Internet Things J., 2019

2017
An exact semidefinite programming approach for the max-mean dispersion problem.
J. Comb. Optim., 2017

Local and global constraint consistency in personnel rostering.
Int. Trans. Oper. Res., 2017

A new exact approach for the 0-1 Collapsing Knapsack Problem.
Eur. J. Oper. Res., 2017

MILP and Max-Clique based heuristics for the Eternity II puzzle.
CoRR, 2017

No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths.
CoRR, 2017

An exact approach for the 0-1 knapsack problem with setups.
Comput. Oper. Res., 2017

Heuristic approaches for a domestic energy management system.
Comput. Ind. Eng., 2017

2016
Searching for a cycle with maximum coverage in undirected graphs.
Optim. Lett., 2016

The one-dimensional cutting stock problem with sequence-dependent cut losses.
Int. Trans. Oper. Res., 2016

A hybrid three-phase approach for the Max-Mean Dispersion Problem.
Comput. Oper. Res., 2016

2015
An Integrated System to Acquire Knowledge and Support Decisions in Complex Innovation Design Processes.
J. Organ. Comput. Electron. Commer., 2015

2014
A hybrid heuristic approach for single machine scheduling with release times.
Comput. Oper. Res., 2014

A variable neighborhood search based matheuristic for nurse rostering problems.
Ann. Oper. Res., 2014

A matheuristic approach for the two-machine total completion time flow shop problem.
Ann. Oper. Res., 2014

A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2012
Improved LP-based algorithms for the closest string problem.
Comput. Oper. Res., 2012

Matheuristics for combinatorial optimization problems: applications to services and production systems.
4OR, 2012

A System To Integrate Unstructured And Semistructured Information Resources: An Application In An Innovation Design Process.
Proceedings of the Fusing Decision Support Systems into the Fabric of the Context, 2012

2011
Matheuristics for Combinatorial Optimization Problems:Applications to Services and Production Systems.
PhD thesis, 2011

A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

2010
A System to Analyse Interviews and Structure the Acquired Knowledge Elements.
Proceedings of the Bridging the Socio-technical Gap in Decision Support Systems, 2010


  Loading...