Skip to content

Author

Rosario Scatamacchia

We have 1 of 43 papers

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

A general methodology to derive approximation results for different algorithms that share the following high-level structure is proposed: a specific procedure is first applied to a list of long jobs, followed by a standard list scheduling approach.

Luca Savant Aira, Rosario Scatamacchia, F. 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.