A competent memetic algorithm for complex scheduling

DOI10.1007/s11047-011-9300-yzbMath1251.68202WikidataQ57587863 ScholiaQ57587863MaRDI QIDQ1761722

Miguel A. González, Camino R. Vela, Ramiro Varela

Publication date: 15 November 2012

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-011-9300-y

zbMATH Keywords

scheduling; tabu search; setup times; memetic algorithms

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

The third comprehensive survey on scheduling problems with setup times/costs, Genetic tabu search for the fuzzy flexible job shop problem, Scatter search with path relinking for the job shop with time lags and setup times, A neighborhood for complex job shop scheduling problems with regular objectives

Uses Software

• JOBSHOP

Cites Work

• Unnamed Item
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• Job shop scheduling with setup times, deadlines and precedence constraints
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• A generalized permutation approach to job shop scheduling with genetic algorithms
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• Applying tabu search to the job-shop scheduling problem
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• A Computational Study of the Job-Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem