In this paper, we consider the identical parallel machines scheduling problem with exponential time-dependent deterioration. The meaning of time-dependent deterioration is that the processing time of a job is not a constant and depends on the scheduled activities. In other words, when a job is processed later, it needs more processing time compared to the jobs processed earlier. The main purpose is to minimize the makespan. To reach this aim, we developed a mixed integer programming formulation for the problem. We solved problem in small scale using GAMS software, while due to the fact that in larger scales the aforesaid case is a complex and intricate optimized problem which is NP-hard, it is not possible to solve it by standard calculating techniques (in logical calculating times); we applied the meta-heuristic genetic algorithm, simulating annealing and artificial immune system, and their performance has been evaluated. In the end, we showed that solving the problem in small scale, with the meta-heuristic algorithms (GA, SA, and AIS) equals the optimal solution (GAMS), And on a large scale, at a time of approximately equal solution, meta-heuristic algorithm simulating annealing, provides a more optimal solution.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.