Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan

DOI10.1051/ro/2024029MaRDI QIDQ6594026

Izzeldin M. Osman, Pierre Laroche, Gais Alhadi, Imed Kacem

Publication date: 27 August 2024

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingapproximationmakespanPTASmaximum latenessFPTASmultiobjective scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

This page was built for publication: Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan