A memetic algorithm for restoring feasibility in scheduling with limited makespan

DOI10.1007/s11047-020-09796-1zbMath1530.90041OpenAlexW3040645728MaRDI QIDQ6177176

Carlos Mencía, Ramiro Varela, Raúl Mencía

Publication date: 31 August 2023

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

Full work available at URL: https://doi.org/10.1007/s11047-020-09796-1

zbMATH Keywords

schedulinglocal searchmemetic algorithminfeasibility

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Total completion time with makespan constraint in no-wait flowshops with setup times
• SAT-based MaxSAT algorithms
• Depth-first heuristic search for the job shop scheduling problem
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• Minimal sets on propositional formulae. Problems and reductions
• A generalized permutation approach to job shop scheduling with genetic algorithms
• Benchmarks for basic scheduling problems
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• Scheduling a two-stage flowshop under makespan constraint
• Complex Scheduling
• Job Shop Scheduling by Simulated Annealing
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: A memetic algorithm for restoring feasibility in scheduling with limited makespan