New Precedence Theorems for One-Machine Weighted Tardiness
From MaRDI portal
(Redirected from Publication:5388048)
Recommendations
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
- STACS 2004
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- New insights on the single machine total tardiness problem
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Minimizing total tardiness on parallel machines with preemptions
Cited in
(16)- The single-machine total tardiness scheduling problem: review and extensions
- Distributionally robust single machine scheduling with the total tardiness criterion
- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Minimizing the weighted sum of squared tardiness on a single machine
- Augmentations of consistent partial orders for the one-machine total tardiness problem
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Minimizing delays in a shunting yard
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
- The proportionate flow shop total tardiness problem
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
- One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
- Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
- Domain-independent dynamic programming
This page was built for publication: New Precedence Theorems for One-Machine Weighted Tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388048)
