摘要

Nowadays, the importance of timely delivery, which is based on the just in time concept, has caused a number of criteria related to scheduling problems to be taken into consideration. One of the most important of these criteria is maximum earliness to control final costs and number of tardy jobs in an attempt to win customer satisfaction. In this paper, the strongly NP-hard problem of the single machine scheduling with two criteria, i.e., maximum earliness and number of tardy jobs, has been considered. For this purpose, artificial immune system which is inspired by the immunology theory in biology has been used. This algorithm is applied to different instances of small to large sizes and the obtained results is compared with those obtained from a heuristic method and a genetic algorithm reported in the literature. Computational results show a significant preference for the algorithm proposed in this paper.

  • 出版日期2011-5