A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
type: Item
instance of: scholarly article
title: A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
zbMATH Open document ID: 0909.90178
published in: Journal of Scheduling
publication date: 1998-11-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1216801
zbMATH Keywords: batching
zbMATH Keywords: local search
zbMATH Keywords: neighbourhoods
zbMATH Keywords: shortest path problem
zbMATH Keywords: tabu search
zbMATH Keywords: single-machine batching
author: Johann L. Hurink
MaRDI profile type: Publication
OpenAlex ID: W2028013451
DOI: 10.1002/(SICI)1099-1425(1998100)1:3%3C127::AID-JOS11%3E3.0.CO;2-9
full work available at URL: https://doi.org/10.1002/(sici)1099-1425(1998100)1:3%3C127::aid-jos11%3E3.0.co
description: scientific article; zbMATH DE number 1216801