8 docs tagged with "scheduling"

Earliest Deadline First (EDF) is a dynamic priority scheduling algorithm where processes are scheduled according to their deadlines. The process with the nearest deadline is executed first.

First Come First Served (FCFS) is a simple scheduling algorithm where processes are handled in the order they arrive, without priority.

In this blog post, we'll explore the Job Sequencing problem, a classical greedy algorithm that schedules jobs within their deadlines to maximize profit.

Priority Scheduling is a scheduling algorithm that selects processes based on priority. Higher priority processes are executed before lower priority ones.

Round Robin (RR) is a preemptive scheduling algorithm where each process is assigned a fixed time slice in a cyclic order.

Shortest Job Remaining First (SJR) is a preemptive scheduling algorithm that selects the process with the smallest remaining time to execute next.

The program finds a valid order for task execution based on dependencies, using Topological Sorting with Kahn’s algorithm.

In this post, we'll explore the Two City Scheduling problem, a classic algorithmic challenge that can be solved efficiently using 3D Dynamic Programming. We'll delve into the problem's constraints, discuss the dynamic programming approach, and provide solutions in multiple languages such as C++, Java, Python, JavaScript, and Go. By the end, you'll understand how to use DP to minimize the total travel costs for sending an equal number of people to two different cities.