Optimization of G/G/1/K cyclic service system with k-limited discipline

In this paper, an ordinal optimization theory based approach is proposed to solve for a good enough solution of the G/G/1/K cyclic service system with k-limited discipline using reasonable computation time. First, a rough model using stochastic simulation with a small amount of served customers will be used as a fitness function evaluation in particle swarm optimization to select N roughly good solutions from search space. Next, starting from the selected N roughly good solutions we proceed with goal softening procedure to search for a good enough solution. The vector of good enough k-limited discipline obtained by the proposed algorithm is promising in the aspects of solution quality and computational efficiency.