Information Operator Scheduling by Genetic Algorithms

In this paper, we discuss an approach to an operator scheduling problem in a large organization over time with the aim of maintaining service quality and reducing total labor costs. We propose a genetic algorithm (GA) with a parameterized fitness function inspired by homotopy methods and with null mutation to handle a variable number of operators. The proposed method is applied to the practical problem of scheduling operators in a telephone information center. Experimental results show that the proposed method performs consistently better than a GA method previously developed.

[1]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[2]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[3]  Colin R. Reeves,et al.  Permutation flowshop scheduling by genetic local search , 1997 .

[4]  E. Allgower,et al.  Numerical Continuation Methods , 1990 .

[5]  Emile H. L. Aarts,et al.  Genetic local search for the traveling salesman problem , 1998 .

[6]  Eugene L. Allgower,et al.  Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.

[7]  T. Yamada,et al.  Job shop scheduling , 1997 .

[8]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

[9]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[10]  R. Nakano,et al.  Genetic algorithm for information operator scheduling , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[11]  Peter J. Fleming,et al.  Genetic Algorithms in Engineering Systems , 1997 .