![]() Meta-heuristic genetic algorithm (GA) is considered as it has the scope of improving performance measure of the problem. ![]() Hence, development of an efficient heuristic is inevitable to minimise the makespan of the open shop scheduling problem. This problem comes under combinatorial category. In this research, open shop scheduling problem with an objective of minimising the makespan is considered. Scheduling problem deals with the management of the resources in most optimal manner.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |