A tabu search approach for the single machine mean tardiness problem

DOI10.1057/palgrave.jors.2600412zbMath0881.90071OpenAlexW2018831454MaRDI QIDQ4346460

No author found.

Publication date: 3 August 1997

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.2600412

zbMATH Keywords

heuristicstabu searchsingle machine mean tardiness scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert ⋮ Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert

This page was built for publication: A tabu search approach for the single machine mean tardiness problem