Evolutionary algorithms for customer order scheduling

DOI10.26516/1997-7670.2025.53.3MaRDI QIDQ6899570zbMATH OpenFDO

Authors Pavel Borisovsky, Alekseĭ Olegovich Zakharov, Julia Viktorovna Kovalenko

Publication date 14 November 2025

Published in Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL https://mathizv.isu.ru/en/article/file?id=1544

zbMATH Keywords

evolutionary algorithmmodelproductionschedulingsetup time

Mathematics Subject Classification ID

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

Cites work

• A learning-based two-stage optimization method for customer order scheduling
• A note on the complexity of the concurrent open shop problem
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• Customer order scheduling on a single machine with family setup times: complexity and algorithms
• From black-box complexity to designing new genetic algorithms
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1337869 (Why is no real title available?)
• Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
• Integer programming models and metaheuristics for customer order scheduling
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• The use of dynamic programming in genetic algorithms for permutation problems

This page was built for publication: Evolutionary algorithms for customer order scheduling

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