Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates

DOI10.1080/03155986.1997.11732336zbMath0894.90083OpenAlexW2401524902MaRDI QIDQ4380543

Keisuke Tanaka, Milan Vlach

Publication date: 7 September 1998

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1997.11732336

zbMATH Keywords

single machinedue datesapproximation algorithmsNP completeness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The quadratic balanced optimization problem

This page was built for publication: Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates