This project can help you understand the Data Structure and Algorithms in a more efficient manner. It aims at scheduling the studies for maximizing marks during exams. Most students face this problem during exams that what to study to get the best out of their limited time.

A lightweight distributed task scheduling framework based on SpringBoot framework. It not only has high availability and scalability but also is easy to customize your business application by API provided.

Implementation of job-shop scheduling problem using C#.

Python Standard Library eXtension

Implementation of AWS media transcoding cloud service (Elastic Transcoder) in Node (Express) Js.

Job scheduling using 1D bin-packing algorithm

Job scheduling : Greedy Algorithm versus Brute Force Algorithm. Comparison of time of complexities.

The project is focused on simulating the multiprogramming of a specific operating system and dealing with CPU scheduling and Job scheduling

Five Java projects assigned for the Data Structures and Algorithms (CMPE 250) course in the Fall 2021-22 semester.

⚙️ Effortless and efficient task scheduling tailored for production, built with numpy.

This Python script uses Evolution Strategy (ES) to minimize maximum lateness on a single machine (1||Lmax).

Bull queue implementation for job queues, scheduled jobs and asynchronous email sending

Data produced by LSAM for testing parallel file system

This repository contains simple implementation of Exhaustive Algorithm and Greedy Algorithm on simple job scheduling.

The project implements a dynamic programming approach to solve the Weighted Interval Scheduling problem, efficiently finding the optimal set of non-overlapping jobs with maximum profit from a given set of intervals.

Applying Dynamic Programming for Job Scheduling Problem

Example code for using CRONOS in .NET 7

A library that extends Quartz.NET to provide a seamless job retry mechanism on failures.

The problem of Weighted Job Scheduling considers a set of jobs. Each job has a start time, a finish time and a profit. The goal is to find a subset of jobs with the maximum profit such that no two jobs in the subset overlap. My solution uses Dynamic Programming.