A locally optimal insertion heuristic for a one-machine scheduling problem

DOI10.1051/RO/1990240302551MaRDI QIDQ3204311zbMATH OpenOpenAlexWikidataFDO

Authors Frank Werner

Publication date 1990

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104985

zbMATH Keywords

heuristicone-machine schedulingrelease dates

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3848954
• Minimizing late jobs in the general one machine scheduling problem
• An improved heuristic for one-machine scheduling with delays constraints
• Dominance-based heuristics for one-machine total cost scheduling problems
• A hybrid heuristic approach for single machine scheduling with release times

This page was built for publication: A locally optimal insertion heuristic for a one-machine scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204311)