Effect of solution representations on tabu search in scheduling applications
From MaRDI portal
Publication:336636
DOI10.1016/j.cor.2013.06.003zbMath1348.90246OpenAlexW2057180570MaRDI QIDQ336636
Muh-Cherng Wu, Keng-Han Lin, Chen-Fu Chen
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.003
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- A tabu search approach for scheduling hazmat shipments
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
- An integrated tabu search algorithm for the lot streaming problem in job shops
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Solving zero-one mixed integer programming problems using tabu search
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- A comprehensive review and evaluation of permutation flowshop heuristics
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
- Flowshop scheduling research after five decades
- Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
- Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
- Tabu Search—Part I
- Tabu Search—Part II
- Flowshop-scheduling problems with makespan criterion: a review
