A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
From MaRDI portal
Publication:4868837
DOI10.1057/jors.1996.15zbMath0842.90068OpenAlexW2055870269MaRDI QIDQ4868837
No author found.
Publication date: 7 March 1996
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1996.15
heuristicsNP-completemean flow timepolynomial-time heuristicscheduling jobssingle machine with set-up times
Related Items (5)
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times ⋮ Scheduling with batching: A review ⋮ Lower bounds and algorithms for flowtime minimization on a single machine with set-up times ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ A heuristic approach for single-machine scheduling with due dates and class setups.
This page was built for publication: A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
