A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling

DOI10.1057/JORS.1991.170zbMATH Open0737.90035OpenAlexW1971554086MaRDI QIDQ3983500

In-Soo Lee

Publication date: 27 June 1992

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

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

zbMATH Keywords

worst-case performancesingle machine schedulingjust-in-time productionshortest-processing-time

Mathematics Subject Classification ID

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

Related Items (2)

The CLWS heuristic for single machine scheduling problem ⋮ Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags

This page was built for publication: A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling