scientific article
From MaRDI portal
Publication:3626419
zbMath1165.90458MaRDI QIDQ3626419
Publication date: 22 May 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines ⋮ Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines ⋮ Optimal semi-online algorithms for machine covering ⋮ Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines
This page was built for publication:
