This study investigates a single-machine scheduling problem with release times. The objective is to minimize the summation of the weighted earliness and tardiness, subject to the number of tardy jobs. The given n jobs with different earliness and tardiness weights have different release times but the same due date. An algorithm is proposed to efficiently generate Pareto-optimal solutions for any possible number of tardy jobs. The accuracy and run time of our algorithm are discussed. In addition, the results show that the proposed algorithm can eliminate most nodes in the branching tree to efficiently find solutions.
|Number of pages||14|
|Journal||Journal of the Chinese Institute of Industrial Engineers|
|State||Published - Jul 2011|
- tardy jobs