A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times

DOI10.1016/j.cor.2014.04.009zbMath1348.90330OpenAlexW2117062896MaRDI QIDQ337074

Hongyun Xu, Zhipeng Lü, Liji Shen, Aihua Yin, Udo Buscher

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.2014.04.009

zbMATH Keywords

single machine schedulingsequence-dependent setup timeshybrid evolutionary algorithmcrossover operatorpopulation updating

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Effective metaheuristic algorithms for the minimum differential dispersion problem ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• A tabu search algorithm for the single machine total weighted tardiness problem
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
• An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Scheduling in a sequence dependent setup environment with genetic search
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
• Hybrid evolutionary algorithms for graph coloring
• Algorithms for single machine total tardiness scheduling with sequence dependent setups
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
• A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
• Enhancing stochastic search performance by value-biased randomization of heuristics
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
• A memetic algorithm for the total tardiness single machine scheduling problem

This page was built for publication: A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times