scientific article; zbMATH DE number 1488092

MaRDI QIDQ4495197zbMATH OpenFDO

Authors H. M. M. ten Eikelder, Bas J. M. Aarts, M. G. A. Verhoeven, E. Aarts

Publication date 21 October 2001

zbMATH Keywords

job shop schedulingtabu search algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 934537
• scientific article; zbMATH DE number 2209650
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Computational Study of Local Search Algorithms for Job Shop Scheduling

Cited in

(7)

• Local search algorithms for the multiprocessor flow shop scheduling problem
• A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
• Job-shop local-search move evaluation without direct consideration of the criterion's value
• scientific article; zbMATH DE number 934537 (Why is no real title available?)
• Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling
• A batch approximate evaluation method for neighborhood solutions in job shop scheduling
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

This page was built for publication:

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