The following pages link to STACS 2004 (Q5309698):
Displaying 17 items.
- A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449) (← links)
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
- On minimizing the sum of \(k\) tardinesses (Q1178234) (← links)
- On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
- Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
- A metric for total tardiness minimization (Q2362385) (← links)
- Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Minimizing the earliness--tardiness costs on a single machine (Q2499156) (← links)
- (Q3362479) (← links)
- (Q4277261) (← links)
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times (Q4670675) (← links)
- New Precedence Theorems for One-Machine Weighted Tardiness (Q5388048) (← links)
- A note on lot scheduling on a single machine to minimize maximum weighted tardiness (Q6166192) (← links)
