A Hybrid VNS with TS for the Single Machine Scheduling Problem to Minimize the Sum of Weighted Tardiness of Jobs

Authors:
Xianpeng Wang;Lixin Tang
Affiliations:
The Logistics Institute, Northeastern University, Shenyang, China;The Logistics Institute, Northeastern University, Shenyang, China
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 6
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Variable neighborhood search

Computers and Operations Research
Improved heuristics for the n-job single-machine weighted tardiness problem

Computers and Operations Research
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a hybrid variable neighborhood search (VNS) with tabu search for the single machine scheduling problem to minimize the sum of weighted tardiness of jobs, a well-known strongly NP-hard problem. In this algorithm, a pool of many solutions is used in the VNS to simultaneously generate multiple trial solutions to improve the search diversification and a tabu search is incorporated in the local search procedure of VNS to improve the search intensification. Computational results show that the proposed VNS algorithm can obtain good solutions for all standard benchmark problems.