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
The complexity of scheduling job families about a common due date
S. T. Webster
Research output
:
Contribution to journal
›
Article
›
peer-review
42
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The complexity of scheduling job families about a common due date'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Common Due Date
100%
Job Scheduling
89%
Family
30%
Earliness-tardiness
26%
Setup Times
22%
Parallel Machines
21%
Unary
17%
Scheduling Problem
16%
Deviation
14%
Minimise
12%
NP-complete problem
12%
Arbitrary
8%
Business & Economics
Due Dates
70%
Total Tardiness
22%
Parallel Machines
20%
Setup Times
18%
NP-hard
16%
Scheduling Problem
14%
Deviation
13%
Engineering & Materials Science
Scheduling
44%
NP-hard
31%