A metric for total tardiness minimization
From MaRDI portal
Publication:2362385
DOI10.1134/S0005117917040142zbMATH Open1366.90099OpenAlexW2606901934MaRDI QIDQ2362385FDOQ2362385
Alexander A. Lazarev, A. A. Sologub, P. S. Korenev
Publication date: 7 July 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117917040142
Recommendations
- The Total Tardiness Problem: Review and Extensions
- On decomposition of the total tardiness problem
- A note on the equivalence of two heuristics to minimize total tardiness
- scientific article; zbMATH DE number 4047428
- A novel hybrid algorithm for minimizing total weighted tardiness cost
- Minimizing total tardiness on a single machine with controllable processing times
- Minimizing the weighted number of tardy task units
- Minimizing the weighted sum of squared tardiness on a single machine
- STACS 2004
- Time-indexed formulations and the total weighted tardiness problem
Complexity and performance of numerical algorithms (65Y20) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling equal-length jobs on identical parallel machines
- Title not available (Why is that?)
- A fully polynomial approximation scheme for the total tardiness problem
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
- Metrics in scheduling problems
- A scheme of approximation solution of problem 1 |r j|L max
Cited In (3)
This page was built for publication: A metric for total tardiness minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362385)
