An algorithm for minimizing flow time and maximum earliness on a single machine

DOI10.1057/PALGRAVE.JORS.2602610zbMath1171.90399OpenAlexW1968485908MaRDI QIDQ3184459

No author found.

Publication date: 15 October 2009

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

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

zbMATH Keywords

computational complexitymachine schedulingpseudo-polynomial

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

On weighting two criteria with a parameter in combinatorial optimization problems ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion

This page was built for publication: An algorithm for minimizing flow time and maximum earliness on a single machine