This paper proposes a better modified version of a well-known Multi-Objective Evolutionary Algorithm (MOEA) known as Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed algorithm contains a new mutation...This paper proposes a better modified version of a well-known Multi-Objective Evolutionary Algorithm (MOEA) known as Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed algorithm contains a new mutation algorithm and has been applied on a bi-objective job sequencing problem. The objectives are the minimization of total weighted tardiness and the minimization of the deterioration cost. The results of the proposed algorithm have been compared with those of original NSGA-II. The comparison of the results shows that the modified NSGA-II performs better than the original NSGA-II.展开更多
We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. Tradition...We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. Traditionally, such scenarios are modeled by assuming that each customer has the same criterion. In practice, this assumption may not hold. Instead of using a single criterion, we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated with their individual criteria. We examine three basic scheduling criteria： minimizing makespan, minimizing maximum lateness, and minimizing total weighted completion time. We demonstrate all the scheduling problems considered are polynomially solvable.展开更多
文摘This paper proposes a better modified version of a well-known Multi-Objective Evolutionary Algorithm (MOEA) known as Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed algorithm contains a new mutation algorithm and has been applied on a bi-objective job sequencing problem. The objectives are the minimization of total weighted tardiness and the minimization of the deterioration cost. The results of the proposed algorithm have been compared with those of original NSGA-II. The comparison of the results shows that the modified NSGA-II performs better than the original NSGA-II.
文摘We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. Traditionally, such scenarios are modeled by assuming that each customer has the same criterion. In practice, this assumption may not hold. Instead of using a single criterion, we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated with their individual criteria. We examine three basic scheduling criteria： minimizing makespan, minimizing maximum lateness, and minimizing total weighted completion time. We demonstrate all the scheduling problems considered are polynomially solvable.
