Interval-indexed formulation based heuristics for single machine total weighted tardiness problem

Authors:
Arife Burcu Colak Altunc;Ahmet Burak Keha
Affiliations:
Department of Industrial Engineering, Arizona State University, Tempe, AZ 85287, USA;Department of Industrial Engineering, Arizona State University, Tempe, AZ 85287, USA
Venue:
Computers and Operations Research
Year:
2009

Citing 11
Cited 1

Priority rules for job shops with weighted tardiness costs

Management Science
A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
A time indexed formulation of non-preemptive single machine scheduling problems

Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Scheduling to minimize average completion time: off-line and on-line algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Block approach: tabu search algorithm for single machine total weighted tardiness problem

Computers and Industrial Engineering

Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we solve the single machine total weighted tardiness problem by using integer programming and linear programming based heuristic algorithms. Interval-indexed formulation is used to formulate the problem. We discuss several methods to form the intervals and different post-processing methods. Then, we show how our algorithm can be used to improve a population of a genetic algorithm. We also provide some computational results that show the effectiveness of our algorithm. Many aspects of our heuristic algorithm are quite general and can be applied to other scheduling and combinatorial optimization problems.