Show simple item record

dc.contributor.authorLenstra, J. K.
dc.contributor.authorRinnooy Kan, A. H. G.
dc.date.accessioned2008-02-29T09:38:10Z
dc.date.available2008-02-29T09:38:10Z
dc.date.issued1981-03
dc.identifier.issn0210-8054 (versió paper)
dc.identifier.urihttp://hdl.handle.net/2099/4404
dc.description.abstractThis is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development of new polynomial optimization algorithms, and on the other hand the application of the concept of NP-hardness as well as the analysis of approximation algorithms.
dc.format.extentp. 49-57
dc.language.isoeng
dc.publisherUniversitat Politècnica de Barcelona. Centre de Càlcul
dc.relation.ispartofQüestiió. 1981, vol.5, núm.1
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.otherOperations research
dc.subject.otherMathematical programming
dc.titleAn introduction to multiprocessor scheduling
dc.typeArticle
dc.subject.lemacInvestigació operativa
dc.subject.lemacProgramació (Matemàtica)
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming
dc.rights.accessOpen Access
upcommons.ordre7


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 2.5 Spain