Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
From MaRDI portal
Recommendations
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
- New Precedence Theorems for One-Machine Weighted Tardiness
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- On the approximability of single-machine scheduling with precedence constraints
- Single-machine scheduling with precedence constraints and position-dependent processing times
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
Cites work
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A dynamic programming method for single machine scheduling
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- An exact algorithm for single-machine scheduling without machine idle time
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- Dual decomposition of a single-machine scheduling problem
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- Minimizing Total Costs in One-Machine Scheduling
- Near-optimal solutions and large integrality gaps for almost all instances of single-machine precedence-constrained scheduling
- New Precedence Theorems for One-Machine Weighted Tardiness
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rangen: A random network generator for activity-on-the-node networks
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Single-Machine Scheduling with Precedence Constraints
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- Technical Note—A Note on the Weighted Tardiness Problem
Cited in
(7)- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
- New Precedence Theorems for One-Machine Weighted Tardiness
- Sequential testing in sparse precedence networks
- On the complexity of dynamic programming for sequencing problems with precedence constraints
This page was built for publication: Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991104)
