Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates.

This paper concerns with the total weighted tardiness on a single machine scheduling problem with the concept of learning effect and unequal release dates. A mathematical model is proposed with binary variables and only small size problems can be solved efficiently due to its NP-hardness. Therefore, four heuristic methods are developed to solve real size applications including the size of 1000 jobs. Proposed heuristics are: genetic, genetic with solution combination, kangaroo and genetic-kangaroo hybrid algorithms. Results denote that developed heuristics are efficient for the considered problem. Research on this topic shows that no study exists on the total weighted tardiness problem with learning effect and unequal release dates simultaneously tackled in this paper. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)