A population-based variable neighborhood search for the single machine total weighted tardiness problem

DOI10.1016/j.cor.2008.07.009zbMath1179.90163OpenAlexW2048027224MaRDI QIDQ1001005

Lixin Tang, Xianpeng Wang

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

zbMATH Keywords

single machine schedulingvariable neighborhood searchtotal weighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect, Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates, A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem, A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times, Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity, An iterative approach for the serial batching problem with parallel machines and job families, An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands, Variable neighbourhood structures for cycle location problems, On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification, Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness, Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness, Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem, A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups, Variable neighbourhood search: methods and applications, A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM, A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time, Variable neighbourhood search: Methods and applications, Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tabu search algorithm for the single machine total weighted tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
• Variable neighborhood search
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Single machine scheduling to minimize total weighted tardiness
• Future paths for integer programming and links to artificial intelligence
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• 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
• Tabu Search—Part I
• Minimizing Total Costs in One-Machine Scheduling
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Variable neighborhood search: Principles and applications