Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

Authors:
Stavros G. Kolliopoulos;George Steiner
Affiliations:
Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Panepistimiopolis Ilissia, Athens, 15784, Greece;Management Science and Information Systems, McMaster University, Canada
Venue:
Operations Research Letters
Year:
2007

Citing 17
Cited 3

Formulating the single machine sequencing problem with release dates as a mixed integer program

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Structure of a simple scheduling polyhedron

Mathematical Programming: Series A and B
Approximability and nonapproximability results for minimizing total flow time on a single machine

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds

Journal of Algorithms
Approximation in stochastic scheduling: the power of LP-based priority policies

Journal of the ACM (JACM)
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness

Journal of Heuristics
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Random-Based Scheduling: New Approximations and LP Lower Bounds

RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem

Operations Research
Stochastic Machine Scheduling with Precedence Constraints

SIAM Journal on Computing
Approximation algorithms for minimizing the total weighted tardiness on a single machine

Theoretical Computer Science
A fully polynomial approximation scheme for the total tardiness problem

Operations Research Letters

Online scheduling to minimize modified total tardiness with an availability constraint

Theoretical Computer Science
A framework model of production planning optimization for make-to-order discrete manufacturing

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in just-in-time production systems.