Open AccessGrid Computing Model to Solve Job Shop Scheduling and Flow Shop Scheduling by Fuzzy C-Mean Algorithm
Author(s) -
Ajendra Kumar,
Preet Pal Singh,
Dipa Sharma,
Pawan Joshi*
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1107.109119
Subject(s) - flow shop scheduling , job shop scheduling , computer science , fair share scheduling , rate monotonic scheduling , dynamic priority scheduling , two level scheduling , mathematical optimization , job scheduler , distributed computing , mathematics , quality of service , schedule , computer network , operating system , queue
This paper presents two computing model in grid environment to utilize the waiting time of a job on particular machines in Job Shop Scheduling and Flow Shop Scheduling for minimize the makespan or total elapsed time. To determine the sequencing of a job we have applied Fuzzy C-Mean (FCM) clustering algorithm in both Job Shop Scheduling problem and Flow Shop Scheduling problem. Flow Shop Scheduling is a classified case of Job Shop Scheduling in which a specific job sequence is pursued strictly. Two illustrative examples of scheduling problems have been solved by this method and compared our results to some other existing methods discussed in the literature. The experimental result shows that the scheduling system using grid computing can allocate the makespan of service jobs effectively and more efficiently.