Skip to main navigation
Skip to search
Skip to main content
Arizona State University Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Datasets
Prizes
Search by expertise, name or affiliation
A general lower bound for the makespan problem
S. T. Webster
Research output
:
Contribution to journal
›
Article
›
peer-review
13
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A general lower bound for the makespan problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Business & Economics
Makespan
100%
Lower Bounds
89%
Parallel Processors
50%
NP-hard
31%
Mathematics
Lower bound
59%
Parallel Processors
32%
Job Scheduling
31%
Minimise
17%
NP-complete problem
17%
Engineering & Materials Science
NP-hard
87%
Scheduling
61%