Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach

DOI10.1057/jors.1996.132zbMath0864.90062OpenAlexW2022863730MaRDI QIDQ4717156

Eugeniusz Nowicki, Stanisław Zdrzałka

Publication date: 1 December 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.132

zbMATH Keywords

tabu searchsequencingbatchingsingle machine schedulingsetup timesnear-optimal schedulessequence of batches

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Minimizing the total waiting time of intermediate products in a manufacturing process ⋮ Lower bounds and algorithms for flowtime minimization on a single machine with set-up times ⋮ A simulated annealing algorithm for single machine scheduling problems with family setups

This page was built for publication: Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach