A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times

DOI10.1016/j.cor.2008.06.007zbMath1179.90155OpenAlexW2088303050MaRDI QIDQ1000975

J. Martínez

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.06.007

zbMATH Keywords

iterated greedy algorithmdiscrete differential evolution algorithmgreedy randomized adaptive search proceduresingle machine total weighted tardiness problem with sequence dependent setup times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop ⋮ An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost ⋮ Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

Cites Work

• Unnamed Item
• Unnamed Item
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
• 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
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Algorithms for single machine total tardiness scheduling with sequence dependent setups
• A survey of scheduling problems with setup times or costs
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• 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
• A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
• Enhancing stochastic search performance by value-biased randomization of heuristics
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• 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