Skip to content

Author

Rosario Scatamacchia

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Aug 2026

Tight Low-Complexity Approximation for the <i>Q</i> <sub>m</sub> ‖ <i> C <sub>max</sub> </i> Problem via Mathematical Programming Modeli

We consider the well-known uniform machine scheduling problem [Formula: see text], in which we are given a set of n jobs with processing times [Formula: see text] and a set of m parallel machines, each with a corresponding speed factor [Formula: see text] for [Formula: see text]. The goal is to find an assignment of th...

Luca Savant Aira, Rosario Scatamacchia, Federico Della Croce di Dojola · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.