Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem

DOI10.1016/J.COR.2005.07.016MaRDI QIDQ2489308zbMATH OpenOpenAlexFDO

Authors Jean-Paul Watson, Adele E. Howe, L. Darrell Whitley

Publication date 16 May 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.07.016

zbMATH Keywords

Empirical analysisJob-shop schedulingMetaheuristicsTabu search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A tabu search approach to machine scheduling
• scientific article; zbMATH DE number 2221465
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• scientific article; zbMATH DE number 2209650
• scientific article; zbMATH DE number 2209652

Cites work

• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A search space analysis of the job shop scheduling problem
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Algorithms for the maximum satisfiability problem
• Applying tabu search to the job-shop scheduling problem
• Benchmarks for basic scheduling problems
• Deterministic job-shop scheduling: Past, present and future
• Equation of state calculations by fast computing machines
• Facts, Conjectures, and Improvements for Simulated Annealing
• Guided local search with shifting bottleneck for job shop scheduling
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 2065615 (Why is no real title available?)
• scientific article; zbMATH DE number 925015 (Why is no real title available?)
• scientific article; zbMATH DE number 2209652 (Why is no real title available?)
• scientific article; zbMATH DE number 2243399 (Why is no real title available?)
• Insertion techniques for the heuristic solution of the job shop problem
• Job Shop Scheduling by Local Search
• Job Shop Scheduling by Simulated Annealing
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• Optimization by simulated annealing
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Problem difficulty for tabu search in job-shop scheduling
• Scatter Search and Path Relinking: Advances and Applications
• The job shop scheduling problem: Conventional and new solution techniques
• The Reactive Tabu Search

Cited in

(10)

• Optimisation of gravity-fed water distribution network design: a critical review
• Job-shop local-search move evaluation without direct consideration of the criterion's value
• Instance space analysis and algorithm selection for the job shop scheduling problem
• Metaheuristics -- the metaphor exposed
• A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
• scientific article; zbMATH DE number 2221465 (Why is no real title available?)
• scientific article; zbMATH DE number 2243399 (Why is no real title available?)
• Similarity in metaheuristics: a gentle step towards a comparison methodology
• A causal framework for stochastic local search optimization algorithms
• Problem difficulty for tabu search in job-shop scheduling

Describes a project that uses

Uses Software

• Tabu search
• DIMACS

This page was built for publication: Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489308)