Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Minimizing total completion time on parallel machines with deadline constraints
Joseph Y.T. Leung, Michael Pinedo
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
20
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimizing total completion time on parallel machines with deadline constraints'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Parallel Machines
100%
Total Completion Time
100%
Deadline Constraint
100%
Polynomial-time Algorithm
50%
NP-hard
50%
Berlin
50%
Processing Time
50%
Feasible Schedule
50%
Identical Machines
50%
Preemption
50%
Strong NP-hardness
50%
Machine Scheduling
50%
Mathematical Programming
50%
Theory of Machine
50%
Feasible Set
50%
Unrelated Machines
50%
Computer Science
Parallel Machine
100%
Completion Time
100%
polynomial-time algorithm
50%
Processing Time
50%
Feasible Schedule
50%
Mathematical Programming
50%
Mathematics
Minimizes
100%
Polynomial Time
100%
Mathematical Programming
100%
Feasible Set
100%