A metric for total tardiness minimization

DOI10.1134/S0005117917040142MaRDI QIDQ2362385zbMATH OpenOpenAlexFDO

Authors P. S. Korenev, A. A. Sologub, Alexander A. Lazarev

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

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• A fully polynomial approximation scheme for the total tardiness problem
• A scheme of approximation solution of problem 1 |r j|L max
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
• Metrics in scheduling problems
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling equal-length jobs on identical parallel machines

Cited in

(8)

• Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems
• The compound interest in relaxing punctuality
• Metric estimation approach for managing uncertainty in resource leveling problem
• A metric approach for scheduling problems with minimizing the maximum penalty
• Metric approach for finding approximate solutions of scheduling problems
• Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem
• Metric interpolation for the problem of minimizing the maximum lateness for a single machine
• Estimation of absolute error in scheduling problems of minimizing the maximum lateness

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)