scientific article; zbMATH DE number 3989090

From MaRDI portal
Publication:3751359





[For the entire collection see Zbl 0599.00013.] A survey of recent results in scheduling theory, is presented. Complexity results and approximation algorithms with their worst case behaviors, are described. The choice of the results presented has been motivated by the importance of a particular result and by its relevance to a computer scheduling problem. Special attention is paid to scheduling under resource constrains and scheduling in microprocessor systems. An extensive bibliography completes the survey.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751359)