Abstract
This paper introduces genetic algorithms for the jump number scheduling problem. Given a set of tasks subject to precedence constraints, the problem is to construct a schedule to minimize the number of jumps. We show that genetic algorithms outperform the previously known Knuth and Szwarcfiter's exhaustive search algorithm when applied to some classes of orders in which no polynomial time algorithms exist in solving the jump number problem. Values for various parameters of genetic jump number algorithms are tested and results are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bouchitte, V. and Habib, M. (1989) The calculation of invariants for ordered sets, Algorithms and Orders, 231-279.
Cogis, O. and Habib, M. (1979) Nombre de sauts et graphes serie-paralleles, RAIRO Inform. Théor. Appl. 13, 13-18.
Colbourn, C. J. and Pulleyblank, W. R. (1987) Minimizing setup in ordered sets of fixed width, Order 4, 143-154.
Duffus, D., Rival, I. and Winkler, P. (1982) Minimizing setups for cycle-free ordered sets, Proc. Amer. Math. Soc. 85, 509-513.
Faigle, U. and Schrader, R. (1985) A setup heuristic for interval orders, Oper. Res. Lett. 4, 185-188.
Felsner, S. (1990) A 3/2-approximation algorithm for the jump number of interval orders, Order 6, 325-334.
Goldberg, D. E. (1989) Genetic Algorithm in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA.
Holland, J. H. (1975) Adaptation in Natural and Artificial Systems, Michigan University Press, Ann Arbor, MI.
Knuth, D. E. and Szwarcfiter, J. L. (1974) A structured program to generate all topological sorting arrangements, Inform. Process. Lett. 2, 153-157.
Linial, N. (1984) The information-theoretic bound is good for merging, SIAM J. Comput. 13, 795-801.
Mitas, J. (1991) Tackling the jump number of interval orders, Order 8, 115-132.
Pulleyblank, W. R. On minimizing setup in precedence constrained scheduling, Report 81105-OR, University of Bonn.
Rival, I. (1983) Optimal linear extensions by interchanging chains, Proc. Amer. Math. Soc. 83, 387-394.
Brightwell, G. and Winkler, P. (1991) Counting linear extensions, Order 8, 225-242.
Bringhtwell, G. and Winkler, P. Counting linear extensions is #P-complete, in Proc. 23rd ACM Symposium on the Theory of Computing, pp. 175-181.
Sacks, M. (1985) in I. Rival (ed.), Problem Session 1: On enumeration, Graphs and Orders, p. 524.
Sharary, A. and Zaguia, N. (1992) On a setup optimization problem for interval orders, Inform. Proccess Lett. 44, 51-55.
Steiner, G. and Stewart, L. K. (1987) A linear algorithm to find the jump number of 2-dimensional bipartite partial orders, Order 3, 359-367.
Chein, M. and Habib, M. (1980) The jump number of dags and posets: an introduction, Ann. Discrete Math. 9, 243-250.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ngom, A. Genetic Algorithm for the Jump Number Scheduling Problem. Order 15, 59–73 (1998). https://doi.org/10.1023/A:1006069500025
Issue Date:
DOI: https://doi.org/10.1023/A:1006069500025