Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem

Authors:
Peter Greistorfer;Hans Kellerer
Affiliations:
Institut für Industrie und Fertigungswirtschaft, Karl-Franzens-Universität Graz, Universitätsstraße 15/G2, A-8010 Graz, Austria. peter.greistorfer@kfunigraz.ac.at;Institut für Statistik und Operations Research, Karl-Franzens-Universität Graz, Universitätsstraße 15/E3, A-8010 Graz, Austria. hans.kellerer@kfunigraz.ac.at
Venue:
Journal of Heuristics
Year:
2001

Citing 10
Cited 0

Optimal schedules of periodically recurring events

Discrete Applied Mathematics
Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Cyclic schedules for r irregularly occurring events

Journal of Computational and Applied Mathematics
Scheduling periodic events

Discrete Applied Mathematics
Bandwidth packing: a tabu search approach

Management Science
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
Tabu search

Modern heuristic techniques for combinatorial problems
Polygon scheduling

Discrete Applied Mathematics
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cyclic scheduling problem with applications to transport efficiency is considered. Given a set of regular polygons, whose vertices represent regularly occurring events and are lying on a common circle line, the objective is to maximize the distance between the closest vertices of different polygons on the circle line. Lower and upper bounds for the optimal solution of this NP-hard scheduling problem are presented. They are used to improve the quality of a procedure which is applied to solve this problem heuristically. It consists of a greedy starting algorithm and a Tabu Search algorithm. The numerical results show the efficiency of the procedure proposed.