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

DOI10.1016/J.COR.2008.07.009zbMATH Open1179.90163OpenAlexW2048027224MaRDI QIDQ1001005FDOQ1001005

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• Tabu Search—Part I
• Variable neighborhood search
• Variable neighborhood search: Principles and applications
• A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• Single machine scheduling to minimize total weighted tardiness
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
• Minimizing Total Costs in One-Machine Scheduling
• A tabu search algorithm for the single machine total weighted tardiness problem
• Improved heuristics for the \(n\)-job single-machine weighted tardiness problem

Cited In (22)

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

This page was built for publication: A population-based variable neighborhood search for the single machine total weighted tardiness problem

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