STACS 2004

DOI10.1007/B96012MaRDI QIDQ5309698zbMATH OpenOpenAlexFDO

Authors Stavros G. Kolliopoulos, George Steiner

Publication date 1 October 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96012

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• Single machine scheduling to minimize total weighted tardiness
• An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

Cited in

(20)

• On minimizing the sum of k tardinesses
• On polynomial solvability of the high multiplicity total weighted tardiness problem
• Single machine scheduling to minimize total weighted tardiness
• Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
• A metric for total tardiness minimization
• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
• Minimizing the earliness--tardiness costs on a single machine
• An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
• scientific article; zbMATH DE number 4217092 (Why is no real title available?)
• Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
• scientific article; zbMATH DE number 495273 (Why is no real title available?)
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
• New Precedence Theorems for One-Machine Weighted Tardiness
• A branch and bound algorithm to minimize total weighted tardiness on a single processor
• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
• New algorithms for minimizing the weighted number of tardy jobs on a single machine
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

This page was built for publication: STACS 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309698)