scientific article; zbMATH DE number 1076139
From MaRDI portal
Publication:4359582
Recommendations
- On the single machine total tardiness problem
- Solution of the single machine total tardiness problem
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
Cited in
(14)- Decomposition of the single machine total tardiness problem
- Solution of the single machine total tardiness problem
- On the single machine total tardiness problem
- One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
- The Single Machine Early/Tardy Problem
- On the Single-machine Scheduling Problem with Tardiness Penalties
- New insights on the single machine total tardiness problem
- A note on efficient sequences with respect to total flow time and number of tardy jobs
- The single-machine absolute-deviation early-tardy problem with random completion times
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Algorithmic paradoxes of the single-machine total tardiness problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359582)
