Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4634296 | Applied Mathematics and Computation | 2007 | 9 Pages |
Abstract
Today’s importance of on time deliveries according to JIT concept makes managers to consider a desired set of extra ‘due date related’ criteria in the workshop scheduling. These criteria can be stated as tardiness, number of tardy jobs, and earliness. In this paper we focus on the bi-criteria scheduling problem of minimizing the number of tardy jobs and maximum earliness for single machine, in which the idle time is not allowed. The problem is known to be NP-hard. For this problem we developed a genetic algorithm by exploiting its general structure that further improves the initial population, utilizing a heuristic algorithm on the initial population. We present a computational experiment that shows the performance of the developed GA.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Fariborz Jolai, M. Rabbani, S. Amalnick, A. Dabaghi, M. Dehghan, M. Yazadn Parast,