Shubhendu Kshitij Fuladi

Mr. Shubhendu Kshitij Fuladi

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 March 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
SFShubhendu Kshitij Fuladi
Shubhendu Kshitij Fuladi
CKChang Soo Kim
Chang Soo Kim
In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. In the proposed method, a hybrid algorithm is utilized to optimize the static flexible job-shop scheduling problem (FJSP) and dynamic flexible job-shop scheduling problem (DFJSP). This algorithm integrates the genetic algorithm (GA) as a global optimization technique with a simulated annealing (SA) algorithm serving as a local search optimization approach to accelerate convergence and prevent getting stuck in local minima. Additionally, variable neighborhood search (VNS) is utilized for efficient neighborhood search within this hybrid algorithm framework. For the FJSP, the proposed hybrid algorithm is simulated on a 40-benchmark dataset to evaluate its performance. Comparisons among the proposed hybrid algorithm and other algorithms are provided to show the effectiveness of the proposed algorithm, ensuring that the proposed hybrid algorithm can efficiently solve the FJSP, with 38 out of 40 instances demonstrating better results. The primary objective of this study is to perform dynamic scheduling on two datasets, including both single-purpose machine and multi-purpose machine datasets, using the proposed hybrid algorithm with a rescheduling strategy. By observing the results of the DFJSP, dynamic events such as a single machine breakdown, a single job arrival, multiple machine breakdowns, and multiple job arrivals demonstrate that the proposed hybrid algorithm with the rescheduling strategy achieves significant improvement and the proposed method obtains the best new solution, resulting in a significant decrease in makespan.

13 October 2025 in Processes
Verified
Journal Article
Open access
PDF file
SFShubhendu Kshitij Fuladi
Shubhendu Kshitij Fuladi
CKChang Soo Kim
Chang Soo Kim
The flexible job shop scheduling problem (FJSP) becomes significantly more complex when real-world factors such as due dates, sequence-dependent setup times, and processing times are considered as multiple criteria. This study presents a hybrid scheduling approach that combines a genetic algorithm (GA) and variable neighborhood search (VNS), where several dispatching rules are used to create the initial population and improve exploration. The multiple objectives are to minimize makespan, total tardiness, and total setup time while improving overall production efficiency. To test the proposed approach, standard FJSP datasets were extended with due dates and setup times for two different environments. Due dates were generated using the Total Work Content (TWK) method. This study also introduces a dynamic scheduling framework that addresses dynamic events such as machine breakdowns and new job arrivals. A rescheduling strategy was developed to maintain optimal solutions in dynamic situations. Experimental results show that the proposed hybrid framework consistently performs better than other methods in static scheduling and maintains high performance under dynamic conditions. The proposed method achieved 6.5% and 2.59% improvement over the baseline GA in two different environments. The results confirm that the proposed strategies effectively address complex, multi-constraint scheduling problems relevant to Industry 4.0 and smart manufacturing environments.