New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)

DOI10.1023/A:1009617209268zbMath0972.68629OpenAlexW1631850096MaRDI QIDQ5944359

Balasubramanian Rangaswamy, Sheik Meeran, Anant Singh Jain

Publication date: 15 November 2001

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

Full work available at URL: https://doi.org/10.1023/a:1009617209268

zbMATH Keywords

schedulingtabu searchjob-shopneighborhood

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ A very fast TS/SA algorithm for the job shop scheduling problem ⋮ Scheduling the truckload operations in automatic warehouses ⋮ An algorithm for the job shop scheduling problem based on global equilibrium search techniques ⋮ An advanced tabu search algorithm for the job shop problem ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ On single-walk parallelization of the job shop problem solving algorithms ⋮ Multiple machine JIT scheduling: a tabu search approach ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem

This page was built for publication: New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)