OpenAlex
PricingAboutJobs
Log inGet started
Work

An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems

HTML

Year: 1995
Type: article
Source: SIAM Journal on Discrete Mathematics
DOI: 10.1137/s0895480191221829
Authors: Ramesh Krishnamurti, Bhagirath Narahari
Language: English

Topic: Scheduling and Optimization Algorithms
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: preemptive scheduling, approximation algorithms, makespan minimization, polynomial-time approximation, worst-case bounds, independent tasks, NP-hardness

Open Access status: closed
OpenAlex ID: W2006538926
FWCI:
Cites: 9
Cited by: 3
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