An Algorithm for Minimizing the Range of Lateness on a Single Machine

DOI10.1057/jors.1991.32zbMath0722.90035OpenAlexW2082108325MaRDI QIDQ3211100

Rong-Hwa Huang, Ching-Jong Liao

Publication date: 1991

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1991.32

zbMATH Keywords

single machinepseudo-polynomial timeminimizing the range of lateness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Minimum dispersion problems ⋮ On weighting two criteria with a parameter in combinatorial optimization problems ⋮ The balanced traveling salesman problem ⋮ Lexicographic balanced optimization problems ⋮ Minimizing maximum earliness on parallel identical machines ⋮ The quadratic balanced optimization problem

This page was built for publication: An Algorithm for Minimizing the Range of Lateness on a Single Machine