Skip to main navigation
Skip to search
Skip to main content
PolyU Scholars Hub Home
Help & FAQ
Home
Researchers
Units
Research output
Prizes
Activities
Press/Media
Student theses
Search by expertise, name or affiliation
Single machine scheduling to minimize total weighted tardiness
Edwin Tai Chiu Cheng
,
Chi To Ng
, J. J. Yuan
, Z. H. Liu
Department of Logistics and Maritime Studies
The Hong Kong Polytechnic University
Research output
:
Journal article publication
›
Journal article
›
Academic research
›
peer-review
58
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Single machine scheduling to minimize total weighted tardiness'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Processing Time
100%
Single Machine Scheduling
100%
Total Weighted Tardiness
100%
Due Date
66%
Affine
66%
Linear Function
66%
Tardiness
33%
NP-hard
33%
Time Complexity
33%
Polynomially Solvable
33%
Pseudo-polynomial Algorithm
33%
NP-hard Problem
33%
Approximation Algorithms
33%
NP-hardness
33%
Fully Polynomial Time Approximation Scheme
33%
SLK Due Date Assignment
33%
Time Approximation
33%
Strong NP-hardness
33%
Mathematics
Linear Function
100%
Single Machine
100%
Minimizes
100%
Polynomial
50%
NP-hard Problem
50%
Ordinary Sense
50%
Properties and Result
50%
Fully Polynomial-Time Approximation Scheme
50%