Abstract

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 28 September 1976Published online: 13 July 2006Keywordsbin packing, multiprocessor scheduling, approximation algorithms, worst-case analysis, performance boundsPublication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat

Keywords

MultiprocessingMultiprocessor schedulingBin packing problemScheduling (production processes)Computer scienceParallel computingBinDue dateJob shop schedulingMathematicsAlgorithmMathematical optimizationFlow shop schedulingOperating system

Related Publications

Publication Info

Year
1978
Type
article
Volume
7
Issue
1
Pages
1-17
Citations
654
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

654
OpenAlex

Cite This

E. G. Coffman, M. R. Garey, David S. Johnson (1978). An Application of Bin-Packing to Multiprocessor Scheduling. SIAM Journal on Computing , 7 (1) , 1-17. https://doi.org/10.1137/0207001

Identifiers

DOI
10.1137/0207001