Estimation of absolute error in scheduling problems of minimizing the maximum lateness

DOI10.1134/S1064562407040230zbMath1162.90012MaRDI QIDQ2377526

Alexander A. Lazarev

Publication date: 19 January 2009

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

schedulingparallel machinesmaximum lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (4)

Metrics in scheduling problems ⋮ Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Metric approach for finding approximate solutions of scheduling problems

Cites Work

• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine

This page was built for publication: Estimation of absolute error in scheduling problems of minimizing the maximum lateness