A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour

DOI<127::AID-JOS11>3.0.CO;2-9 10.1002/(SICI)1099-1425(1998100)1:3<127::AID-JOS11>3.0.CO;2-9zbMath0909.90178OpenAlexW2028013451MaRDI QIDQ1268835

Johann L. Hurink

Publication date: 1 November 1998

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(1998100)1:3<127::aid-jos11>3.0.co;2-9

zbMATH Keywords

tabu searchlocal searchbatchingshortest path problemneighbourhoodssingle-machine batching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling with batching: A review ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ Family scheduling with batch availability in flow shops to minimize makespan