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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brucker, P., R.E. Burkard, and J. Hurink. (1990). “Cyclic Schedules for r Irregularly Occurring Events.” J. Comput. Appl. Math. 30, 173–189.
Burkard, R.E. (1986). “Optimal Schedules for Periodically Recurring Events.” Discr. Appl. Math. 15, 167–180.
Cerny, J. (1972). “Problems for Systems of Regular Polygons on a Circumference and their Application in Transport.” Matematické obzory 1, 51–59.
Domschke, W. (1989). “Schedule Synchronization for Public Transit Networks.” OR Spektrum 11, 17–24.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.
Glover, F. (1986). “Future Paths for Integer Programming and Links to Artificial Intelligence.” Computers Oper. Res. 13, 533–549.
Glover, F. (1990). “Tabu Search: A Tutorial.” Interfaces 20(4), 74–94.
Glover, F. and M. Laguna. (1993). “Tabu Search.” In C.R. Reeves (ed.), Modern Heuristic Techniques for CombinatorialProblems. Oxford: Blackwell Scientific Publications, pp. 70–150.
Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic Publishers.
Guldan, F. (1980). “Maximization of Distances of Regular Polygons on a Circle.” Aplikace Matematiky 25, 182–195.
Hurink, J. (1996). “Polygon Scheduling.” Discr. Appl. Math. 70, 37–55.
Klemt, W.D. and W. Stemme. (1987). “Schedule Synchronization for Public Transit Networks.” Paper presented at the 4th International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg.
Laguna, M. and F. Glover. (1993). “Bandwith Packing: A Tabu Search Approach.” Management Sci. 39, 492–500.
Niven, I. and H.S. Zukerman. (1960). An Introduction to the Theory of Numbers. New York: J. Wiley.
Osman, I.H. (1993). “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.” Ann. Oper. Res. 41, 421–451.
Osman, I.H. and G. Laporte. (1996). “Metaheuristics: A Bibliography.” Ann. Oper. Res. 63, 513–628.
Vince, A. (1988). “Scheduling Periodic Events.” Discr. Appl. Math. 25, 299–310.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Greistorfer, P., Kellerer, H. Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. Journal of Heuristics 7, 371–390 (2001). https://doi.org/10.1023/A:1011340311793
Issue Date:
DOI: https://doi.org/10.1023/A:1011340311793