Metric approach for finding approximate solutions of scheduling problems

DOI10.1134/S0965542521070125zbMath1471.90071OpenAlexW3194594675MaRDI QIDQ2048806

D. V. Lemtyuzhnikova, N. A. Pravdivets, Alexander A. Lazarev

Publication date: 24 August 2021

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542521070125

zbMATH Keywords

metricapproximationscheduling theoryoptimization methods

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• 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
• Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem
• A fully polynomial approximation scheme for the total tardiness problem
• Improving the complexities of approximation algorithms for optimization problems
• A special case of the single-machine total tardiness problem is NP-hard
• Large-scale problems with quasi-block matrices
• Estimation of absolute error in scheduling problems of minimizing the maximum lateness
• A scheme of approximation solution of problem 1 |r j|L max
• Minimizing Total Tardiness on One Machine is NP-Hard
• Complex Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Metric approach for finding approximate solutions of scheduling problems