OpenAlex
PricingAboutJobs
Log inGet started
Work

A generalized bound on LPT sequencing

HTML

Year: 1976
Type: conference-paper
Source: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)
DOI: 10.1145/800200.806205
Authors: E. G. Coffman, Ravi Sethi
Institution: Pennsylvania State University
Language: English

Topic: Scheduling and Optimization Algorithms
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: worst-case bounds, makespan minimization, parallel job scheduling, bin packing heuristics, processor load balancing

Open Access status: closed
OpenAlex ID: W2000664510
FWCI: 6.612
Cites: 2
Cited by: 66
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security