Browse by Journal Title
Up a level |
earliness-tardiness
Kellerer, Hans and Strusevich, Vitaly A. (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science (IJFCS), 21 (3). pp. 357-383. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:https://doi.org/10.1142/S0129054110007301)
FPTAS
Kellerer, Hans and Strusevich, Vitaly A. (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science (IJFCS), 21 (3). pp. 357-383. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:https://doi.org/10.1142/S0129054110007301)
quadratic knapsack
Kellerer, Hans and Strusevich, Vitaly A. (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science (IJFCS), 21 (3). pp. 357-383. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:https://doi.org/10.1142/S0129054110007301)
single machine scheduling
Kellerer, Hans and Strusevich, Vitaly A. (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science (IJFCS), 21 (3). pp. 357-383. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:https://doi.org/10.1142/S0129054110007301)