A competent memetic algorithm for complex scheduling

DOI10.1007/S11047-011-9300-YMaRDI QIDQ1761722zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

schedulingtabu searchsetup timesmemetic algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A memetic algorithm for the total tardiness single machine scheduling problem
• A memory based Lamarckian evolutionary algorithm for job shop scheduling problems
• Scheduling job shop problems with sequence-dependent setup times
• Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
• Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times

Cites work

• A Computational Study of the Job-Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A branch \& bound method for the general-shop problem with sequence dependent setup-times
• A branch and bound algorithm for the job-shop scheduling problem
• A generalized permutation approach to job shop scheduling with genetic algorithms
• A very fast TS/SA algorithm for the job shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• An advanced tabu search algorithm for the job shop problem
• Applying tabu search to the job-shop scheduling problem
• Guided local search with shifting bottleneck for job shop scheduling
• Job Shop Scheduling by Simulated Annealing
• 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
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• Solution-guided multi-point constructive search for job shop scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(14)

• scientific article; zbMATH DE number 1984236 (Why is no real title available?)
• Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
• A neighborhood for complex job shop scheduling problems with regular objectives
• Memetic Algorithms in Planning, Scheduling, and Timetabling
• AUTOMATED LECTURE TIMETABLING USING A MEMETIC ALGORITHM
• Memetic algorithm timetabling for non-commercial sport leagues.
• A memory based Lamarckian evolutionary algorithm for job shop scheduling problems
• The third comprehensive survey on scheduling problems with setup times/costs
• Memetic techniques for examination timetabling
• A memetic algorithm for the total tardiness single machine scheduling problem
• A memetic algorithm for the flexible flow line scheduling problem with processor blocking
• 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
• Centroid-based memetic algorithm -- adaptive Lamarckian and Baldwinian learning

Describes a project that uses

Uses Software

• JOBSHOP

This page was built for publication: A competent memetic algorithm for complex scheduling

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