Skip to content

Generate gantt chart and calculate turnaround time and waiting time for various CPU scheduling algorithms.

Notifications You must be signed in to change notification settings

boonsuen/process-scheduling-solver

Repository files navigation

Process Scheduling Solver

A web based tool to generate gantt chart and calculate TAT (turnaround time) and WAT (waiting time) based on various scheduling algorithms.

process-scheduling-solver

Get it here: process-scheduling-solver.boonsuen.com

Supported algorithms

  • First Come First Serve / FCFS
  • Shortest Job First / SJF (non-preemptive)
  • Shortest Remaining Time First / SRTF (preemptive)
  • Round-Robin / RR
  • Priority (non-preemptive)
  • Priority (preemptive)

Features

  • Fully responsive
  • Clean & simple user interface
  • Works offline

Built with

  • Next.js
  • TypeScript
  • styled-components

Upcoming

  • Support higher number for higher priority

About

Generate gantt chart and calculate turnaround time and waiting time for various CPU scheduling algorithms.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published