Abstract
In this paper, an efficient tabu search algorithm is prepared for solving the single-machine mean tardiness problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighbourhoods of a given sequence and a combined scheme for intensification and diversification. The tabu search method is shown to produce results very close to the optimal solution using randomly generated problems with varying degrees of difficulty.
| Original language | English |
|---|---|
| Pages (from-to) | 694-700 |
| Number of pages | 7 |
| Journal | Production Planning and Control |
| Volume | 8 |
| Issue number | 7 |
| DOIs | |
| State | Published - 1997 |
Keywords
- Mean Tardiness Heuristics
- Search
- Single-machine Scheduling
- Tabu
ASJC Scopus subject areas
- Computer Science Applications
- Strategy and Management
- Management Science and Operations Research
- Industrial and Manufacturing Engineering