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.

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

Implementation of job-shop scheduling problem using C#.

Cron but with golang time specification. ⏰

Learning in Noisy MDP (which is governed by stochastic, exogenous input processes) with input-dependent baseline

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

Python Standard Library eXtension

The project implements a construction project scheduler to keep track of all the buildings under construction using Min Heap and Red Black Trees. These Data Structures help identify the priority and progress of construction.

Job scheduling using 1D bin-packing algorithm

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

A simple job scheduling tool to manage tasks and GPUs in a single machine with multiple GPUs.

Example code for using CRONOS in .NET 7

Class project for "Data Integration on Web" class of Università di Salerno, Computer Science Master degree. The platform is built using the knowledge acquired during the course to provide a service with which it is easy to find the ideal job.

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.

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.

This is a job scheduling problem solved with minimum complexity. A new city is being constructed and a program is required to keep track of all the buildings that have been built. A building record has 3 fields: Building number, Executed time and Total time. The Min Heap is used to store the buildings based on Executed Time and the RBT stores it…

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

Data produced by LSAM for testing parallel file system

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