An tentative taboo search algorithm for job shop scheduling
From MaRDI portal
Publication:5492513
DOI10.1007/BF02836662zbMath1100.90017MaRDI QIDQ5492513
Wenqi Huang, Zhi Huang, Lei Wang
Publication date: 13 October 2006
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Tabu Search—Part I
- Tabu Search—Part II
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
This page was built for publication: An tentative taboo search algorithm for job shop scheduling