scientific article
From MaRDI portal
Publication:3965895
zbMath0499.90044MaRDI QIDQ3965895
Publication date: 1981
Full work available at URL: https://eudml.org/doc/67266
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitysolution algorithmoptimal job schedulingminimization of total penalty function
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Some concepts of stability analysis in combinatorial optimization ⋮ Stability of compatible schedules
This page was built for publication: