A web-based tool to generate Gantt charts and calculate TAT (Turnaround Time) and WT (Waiting Time) based on various scheduling algorithms. It currently supports the First Come First Serve (FCFS) algorithm.
✨ Intuitive Interface: Easily input process details and select a scheduling algorithm.
📈 Gantt Chart Generation: Generate visual Gantt charts representing the scheduling order.
⏱️ Turnaround Time (TAT) Calculation: Calculate the turnaround time for each process.
⌚ Waiting Time (WT) Calculation: Calculate the waiting time for each process.
🔄 Support for FCFS Algorithm: The tool currently supports the First Come First Serve (FCFS) algorithm.
🚀 Extensibility: Extend the tool to include other popular scheduling algorithms like Round Robin (RR), Shortest Job First (SJF), and more.
🎉 Thank you for considering contributing to this project! 🎉
If you'd like to contribute and extend the tool with additional features or scheduling algorithms, please follow these steps:
-
Fork the repository.
-
Create a new branch to work on your feature or improvement.
-
Make the necessary changes and commit them.
-
Push your changes to your forked repository.
-
Open a pull request and describe the changes you've made.
-
Wait for the review and merge of your pull request.
Let's work together to make this tool even more powerful and versatile!
If you find this project helpful or interesting, please consider giving it a star! It helps to show your support and encourages further development.
🌟 Give a Star to this Repository
You can access the web-based tool through the following GitHub Pages link:
🔗 Process Scheduling Solver GitHub Page
Feel free to explore the tool, generate Gantt charts, calculate TAT and WT, and contribute to its development.
This project is licensed under the MIT License. You are free to use, modify, and distribute the code.
