A metric for total tardiness minimization

DOI10.1134/S0005117917040142zbMath1366.90099OpenAlexW2606901934MaRDI QIDQ2362385

A. A. Sologub, P. S. Korenev, 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

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

Related Items (1)

A metric approach for scheduling problems with minimizing the maximum penalty

Cites Work

• Unnamed Item
• Metrics in scheduling problems
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
• Scheduling equal-length jobs on identical parallel machines
• A fully polynomial approximation scheme for the total tardiness problem
• A scheme of approximation solution of problem 1 |r j|L max
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: A metric for total tardiness minimization