Add SlackTimeScheduling algorithm (#5814)

src/main/java/com/thealgorithms/scheduling/SlackTimeScheduling.java

@@ -0,0 +1,64 @@
+package com.thealgorithms.scheduling;
+
+import java.util.ArrayList;
+import java.util.Comparator;
+import java.util.List;
+
+/**
+ * SlackTimeScheduling is an algorithm that prioritizes tasks based on their
+ * slack time, which is defined as the difference between the task's deadline
+ * and the time required to execute it. Tasks with less slack time are prioritized.
+ *
+ * Use Case: Real-time systems with hard deadlines, such as robotics or embedded systems.
+ *
+ * @author Hardvan
+ */
+public class SlackTimeScheduling {
+
+    static class Task {
+        String name;
+        int executionTime;
+        int deadline;
+
+        Task(String name, int executionTime, int deadline) {
+            this.name = name;
+            this.executionTime = executionTime;
+            this.deadline = deadline;
+        }
+
+        int getSlackTime() {
+            return deadline - executionTime;
+        }
+    }
+
+    private final List<Task> tasks;
+
+    public SlackTimeScheduling() {
+        tasks = new ArrayList<>();
+    }
+
+    /**
+     * Adds a task to the scheduler.
+     *
+     * @param name          the name of the task
+     * @param executionTime the time required to execute the task
+     * @param deadline      the deadline by which the task must be completed
+     */
+    public void addTask(String name, int executionTime, int deadline) {
+        tasks.add(new Task(name, executionTime, deadline));
+    }
+
+    /**
+     * Schedules the tasks based on their slack time.
+     *
+     * @return the order in which the tasks should be executed
+     */
+    public List<String> scheduleTasks() {
+        tasks.sort(Comparator.comparingInt(Task::getSlackTime));
+        List<String> scheduledOrder = new ArrayList<>();
+        for (Task task : tasks) {
+            scheduledOrder.add(task.name);
+        }
+        return scheduledOrder;
+    }
+}