GitHub

Java-based simulation comparing FCFS and SJF scheduling algorithms, analysing waiting time, turnaround time, and response time under varying system load.

This project extends a provided coursework codebase to run an experimental comparison of two classic CPU scheduling algorithms: First Come First Served (FCFS) and Shortest Job First (SJF). The ...
FinanceFeeds

What Is FCFS in Crypto and When Is It Used?

Explore the concept of First Come First Served (FCFS) in cryptocurrency, its role in token sales and NFT drops ...
IEEE

Reinforcement Learning Assisting Artificial Bee Colony Algorithm for Scheduling Distributed Assembly Flowshops With Batch Delivery

Abstract: In response to escalating market demands, we extend the distributed assembly flowshop problems (DAFSPs) by incorporating batch delivery, optimizing both total energy consumption (TEC) and ...
IEEE

Dynamic Scheduling Algorithm for Flexible Job Shops Based on Non-Cooperative Game Theory

Abstract: This paper focuses on the dynamic scheduling problem of flexible job-shop (FJSDS) and proposes a rescheduling optimization algorithm based on non-cooperative game theory. The research aims ...
GitHub

This repository represents my journey of learning and practicing Data Structures and Algorithms (DSA) using Java.

There was an error while loading. Please reload this page.