Archivio Istituzionale della RicercaSALASSA, FABIO GUIDO MARIO
SALASSA, FABIO GUIDO MARIO
Dipartimento di Ingegneria Gestionale e della Produzione
017702
A note on “Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers”
2025 Grosso, Andrea; Salassa, Fabio
Branch-and-bound-and-memorize for the blocking permutation flowshop problem
2025 Bargetto, Roberto; Salassa, Fabio
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
2025 Druetto, Alessandro; Grosso, Andrea; Jeunet, Jully; Salassa, Fabio
Exact approaches for parallel machine scheduling with loading and unloading servers
2025 Druetto, Alessandro; Grosso, Andrea; Jeunet, Jully; Salassa, Fabio; Chiaramello, Enrico
Single machine rescheduling for new orders with maximum and total time disruption constraints
2025 Rener, Elena; Salassa, Fabio; T'Kindt, Vincent
Optimised break scheduling vs. rest breaks in collective agreements under fatigue and non preemption
2024 Jeunet, Jully; Salassa, Fabio
Permutation flowshop problems minimizing core waiting time and core idle time
2023 Alfieri, Arianna; Garraffa, Michele; Pastore, Erica; Salassa, Fabio
The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations
2023 Jeunet, Jully; Salassa, FABIO GUIDO MARIO
A simple and effective algorithm for the maximum happy vertices problem
2022 Ghirardi, Marco; Salassa, Fabio
Exact solution of the two-machine flow shop problem with three operations
2022 Della Croce, Federico; Salassa, Fabio; T’Kindt, Vincent
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem
2022 Balogh, Andrea; Garraffa, Michele; O’Sullivan, Barry; Salassa, Fabio
Single machine rescheduling for new orders with maximum lateness minimization
2022 Rener, Elena; Salassa, Fabio; T’Kindt, Vincent
Column generation for minimizing total completion time in a parallel-batching environment
2021 Alfieri, A.; Druetto, A.; Grosso, A.; Salassa, F.
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
2021 Jeunet, J.; Della Croce, F.; Salassa, F.
Merging Combinatorial Design and Optimization: the Oberwolfach Problem
2021 Salassa, FABIO GUIDO MARIO; Dragotto, Gabriele; Traetta, Tommaso; Buratti, Marco; DELLA CROCE DI DOJOLA, Federico
A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids
2019 Barbierato, Luca; Estebsari, Abouzar; Pons, Enrico; Pau, Marco; Salassa, FABIO GUIDO MARIO; Ghirardi, Marco; Patti, Edoardo
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
2019 Della Croce, Federico; Grosso, Andrea; Salassa, Fabio
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
2019 Billaut, J. -C.; Della Croce, F.; Salassa, F.; T’Kindt, V.
A new exact approach for the 0–1 Collapsing Knapsack Problem
2017 DELLA CROCE DI DOJOLA, Federico; Salassa, FABIO GUIDO MARIO; Scatamacchia, Rosario
An exact approach for the 0–1 knapsack problem with setups
2017 DELLA CROCE DI DOJOLA, Federico; Salassa, FABIO GUIDO MARIO; Scatamacchia, Rosario
| Citazione | Data di pubblicazione | Autori | File |
|---|---|---|---|
| A note on “Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers” / Grosso, A., Salassa, F.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 180:(2025). [10.1016/j.cor.2025.107055] | 1-gen-2025 | Salassa, Fabio + | R2CommonServerNote_COR_2025.pdf |
| Branch-and-bound-and-memorize for the blocking permutation flowshop problem / Bargetto, R., Salassa, F.. - In: OPTIMIZATION LETTERS. - ISSN 1862-4472. - 19:9(2025), pp. 1979-1996. [10.1007/s11590-025-02200-w] | 1-gen-2025 | Bargetto, RobertoSalassa, Fabio | s11590-025-02200-w.pdf |
| Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server / Druetto, A., Grosso, A., Jeunet, J., Salassa, F.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 174:(2025). [10.1016/j.cor.2024.106911] | 1-gen-2025 | Salassa, Fabio + | CommonServer_COR_2025.pdf |
| Exact approaches for parallel machine scheduling with loading and unloading servers / Druetto, A., Grosso, A., Jeunet, J., Salassa, F., Chiaramello, E.. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - 210:(2025). [10.1016/j.cie.2025.111550] | 1-gen-2025 | Grosso, AndreaJeunet, JullySalassa, Fabio + | CommonServer(s)_CAIE_2025.pdf |
| Single machine rescheduling for new orders with maximum and total time disruption constraints / Rener, E., Salassa, F., T'Kindt, V.. - In: JOURNAL OF SCHEDULING. - ISSN 1094-6136. - (2025). [10.1007/s10951-025-00837-0] | 1-gen-2025 | Salassa, Fabio + | ReschedulingPoly_JOSH_2025.pdf |
| Optimised break scheduling vs. rest breaks in collective agreements under fatigue and non preemption / Jeunet, J., Salassa, F.. - In: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS. - ISSN 0925-5273. - ELETTRONICO. - 275:(2024). [10.1016/j.ijpe.2024.109343] | 1-gen-2024 | Jeunet, JullySalassa, Fabio | BreakScheduling_IJPE_2024.pdf |
| Permutation flowshop problems minimizing core waiting time and core idle time / Alfieri, A., Garraffa, M., Pastore, E., Salassa, F.. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - ELETTRONICO. - 176:(2023), p. 108983. [10.1016/j.cie.2023.108983] | 1-gen-2023 | Arianna AlfieriMichele GarraffaErica PastoreFabio Salassa | RevisedManuscript_noauthors_NoTrackchange.pdf; 1-s2.0-S0360835223000074-main.pdf |
| The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations / Jeunet, J., Salassa, F.G.M.. - In: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. - ISSN 0020-7543. - 61:(2023), pp. 5372-5391. [10.1080/00207543.2022.2101402] | 1-gen-2023 | Jully JeunetFabio Salassa | The discrete time break scheduling problem under fatigue and no preemption solution methods and impact of work regulations.pdf |
| A simple and effective algorithm for the maximum happy vertices problem / Ghirardi, M., Salassa, F.. - In: TOP. - ISSN 1134-5764. - ELETTRONICO. - 30:(2022), pp. 181-193. [10.1007/s11750-021-00610-4] | 1-gen-2022 | Ghirardi, MarcoSalassa, Fabio | Ghirardi-Salassa2021_Article_ASimpleAndEffectiveAlgorithmFo.pdf |
| Exact solution of the two-machine flow shop problem with three operations / Della Croce, F., Salassa, F., T’Kindt, V.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - ELETTRONICO. - 138:(2022), p. 105595. [10.1016/j.cor.2021.105595] | 1-gen-2022 | Della Croce, FedericoSalassa, FabioT’kindt, Vincent | 1-s2.0-S0305054821003178-main.pdf |
| MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem / Balogh, A., Garraffa, M., O’Sullivan, B., Salassa, F.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 146:(2022), p. 105862. [10.1016/j.cor.2022.105862] | 1-gen-2022 | Salassa, Fabio + | TotalTardiNoIdle_COR_2022.pdf |
| Single machine rescheduling for new orders with maximum lateness minimization / Rener, E., Salassa, F., T’Kindt, V.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 144:(2022). [10.1016/j.cor.2022.105815] | 1-gen-2022 | Rener, ElenaSalassa, Fabio + | 1-s2.0-S0305054822000995-main.pdf |
| Column generation for minimizing total completion time in a parallel-batching environment / Alfieri, A., Druetto, A., Grosso, A., Salassa, F.. - In: JOURNAL OF SCHEDULING. - ISSN 1094-6136. - ELETTRONICO. - 24:(2021), pp. 569-588. [10.1007/s10951-021-00703-9] | 1-gen-2021 | Alfieri A.Salassa F. + | Alfieri2021_Article_ColumnGenerationForMinimizingT.pdf |
| Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs / Jeunet, J., Della Croce, F., Salassa, F.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - ELETTRONICO. - 127:(2021). [10.1016/j.cor.2020.105151] | 1-gen-2021 | Della Croce F.Salassa F. + | 1-s2.0-S0305054820302689-main.pdf |
| Merging Combinatorial Design and Optimization: the Oberwolfach Problem / Salassa, F.G.M., Dragotto, G., Traetta, T., Buratti, M., DELLA CROCE DI DOJOLA, F.. - In: THE AUSTRALASIAN JOURNAL OF COMBINATORICS. - ISSN 2202-3518. - 79:1(2021), pp. 141-166. | 1-gen-2021 | Fabio SalassaGabriele DragottoFederico Della Croce + | ajc_v79_p141.pdf |
| A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids / Barbierato, L., Estebsari, A., Pons, E., Pau, M., Salassa, F.G.M., Ghirardi, M., Patti, E.. - In: IEEE INTERNET OF THINGS JOURNAL. - ISSN 2327-4662. - STAMPA. - 6:1(2019), pp. 1136-1146. [10.1109/JIOT.2018.2867511] | 1-gen-2019 | Luca BarbieratoAbouzar EstebsariEnrico PonsFabio SalassaMarco GhirardiEdoardo Patti + | main.pdf; 08449080.pdf |
| Minimizing total completion time in the two-machine no-idle no-wait flow shop problem / Della Croce, F., Grosso, A., Salassa, F.. - In: JOURNAL OF HEURISTICS. - ISSN 1381-1231. - (2019). [10.1007/s10732-019-09430-z] | 1-gen-2019 | Della Croce, FedericoSalassa, Fabio + | - |
| No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths / Billaut, J.-C., Della Croce, F., Salassa, F., T’Kindt, V.. - In: JOURNAL OF SCHEDULING. - ISSN 1094-6136. - 22:1(2019), pp. 59-68. [10.1007/s10951-018-0562-4] | 1-gen-2019 | Della Croce, F.Salassa, F. + | - |
| A new exact approach for the 0–1 Collapsing Knapsack Problem / DELLA CROCE DI DOJOLA, F., Salassa, F.G.M., Scatamacchia, R.. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - 260:(2017), pp. 56-69. [10.1016/j.ejor.2016.12.009] | 1-gen-2017 | DELLA CROCE DI DOJOLA, FedericoSALASSA, FABIO GUIDO MARIOSCATAMACCHIA, ROSARIO | - |
| An exact approach for the 0–1 knapsack problem with setups / DELLA CROCE DI DOJOLA, F., Salassa, F.G.M., Scatamacchia, R.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 80:(2017), pp. 61-67. [10.1016/j.cor.2016.11.015] | 1-gen-2017 | DELLA CROCE DI DOJOLA, FedericoSALASSA, FABIO GUIDO MARIOSCATAMACCHIA, ROSARIO | KPsetup.pdf; 1-s2.0-S0305054816302787-main.pdf |