Open AccessA Deterministic Flowshop Scheduling Problem to minimizing the Makespan using PA ACO
Author(s) -
Annu Priya,
Sudip Kumar Sahana
Publication year - 2020
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.b4573.029320
Subject(s) - job shop scheduling , mathematical optimization , flow shop scheduling , computer science , initialization , scheduling (production processes) , pareto optimal , ant colony optimization algorithms , multi objective optimization , mathematics , routing (electronic design automation) , computer network , programming language
Scheduling problems are NP-hard in nature. Flowshop scheduling problems, are consist of sets of machines with number of resources. It matins the continuous flow of task with minimum time. There are various traditional algorithms to maintain the order of resources. Here, in this paper a new stochastic Ant Colony optimization technique based on Pareto optimal (PA-ACO) is implemented for solving the permutation flowshop scheduling problem (PFSP) sets. The proposed technique is employed with a novel local path search technique for initializing and pheromone trails. Pareto optimal mechanism is used to select the best optimal path solution form generated solution sets. A comparative study of the results obtained from simulations shows that the proposed PA-ACO provides minimum makespan and computational time for the Taillard dataset. This work will applied on large scale manufacturing production problem for efficient energy utilization.