| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4633987 | Applied Mathematics and Computation | 2008 | 9 Pages |
Abstract
In this study, the well-known one machine problem with the performance criterion of minimizing total weighted tardiness is considered. This problem is known to be NP-hard, and consists of one machine and n independent jobs. Each of these jobs has a distinct integer processing time, a distinct integer weighting factor, and a distinct integer due date. The purpose of this problem is to find a sequence of these jobs minimizing the sum of the weighted tardiness. Using benchmarking problems, this study compares performances of eleven genetic crossover operators which have been widely used to solve other types of hard scheduling problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Talip Kellegöz, Bilal Toklu, John Wilson,