An Efficient Flow Shop Scheduling Problem With Makespan Objective
Main Article Content
Abstract
Scheduling ‘n’ job in ‘m’ machine is a tedious task for the Research scholar to solve this type of problem. Flow shop scheduling has its origin in the manufacturing industries in the early 1954. In this paper, we have developed an algorithm with the objective is to minimize the total elapsed time (makespan). Examples are illustrated to demonstrate the proposed approach in detail. Finally, the result obtained under the proposed method is compared with the existing methods available in the literature. It is found that our algorithm performs better than the existing algorithm and the result have been incorporated in this article.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.