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
· INFORMS journal on computing · 0 citations