A framework for writing performant and reliable networked services.

An asynchronous runtime for writing applications and services. Supports io_uring, epoll, kqueue, and poll for I/O.

Deal with CLI prompts in style

Runtime polymorphism without inheritance (structs, ints, classes, ...)

Codes implementation of the paper "Deep reinforcement learning for minimizing tardiness in parallel machine scheduling with sequence dependent family setups"

Trust infrastructure for AI agents. Know who produced a value, when, and that it hasn't been tampered with. Zero dependencies. Pure C.

Simple list to keep track of on time and tardy students

adds students to late or tardy list.

Async TLS (Secure Socket) for the Tardy runtime

Source code for 'Expert Twisted' by Mark Williams, Brian Warner, Cory Benfield, Dustin Mitchell, Pierre Tardy, Kevin Samuel, and Moshe Zadka

Heuristic solver based on Ant Colony Optimization and designed for the Permutation Flow Shop Scheduling Problem with Weighted Tardiness (PFSP-WT)

An Iterated Greedy algorithm applied in scheduling with rejection and tardiness penalties

A SQL library written in Zig meant for use with the Tardy runtime.

A Python application that optimizes shop floor schedules using a multi-objective Genetic Algorithm (GA) to minimize makespan and tardiness.

An SSH client/server using ptys which run in a Bash session in a remote server using pthreads (via thread pool) with epoll and timers to handle tardy clients.

Sigma is a tool that allows to calculate the Makespan, the Tardiness and the Sequence of a flow-shop optimization problem of n jobs and m machines, taking in consideration the setup time and the due dates.

Multi-objective job shop scheduling system using NSGA-II algorithm to optimize makespan, energy costs, and tardiness simultaneously. Features energy-aware scheduling with time-of-use tariffs and Pareto front visualization

Examines a private Google Groups RSS feed to determine who has and has not posted during the week

An app that helps students track their attendance in subjects at colleges to efficiently manage their time

ant colony optimization for single machine scheduling problem with the objective of minimizing the total tardiness

Timo, is intended to help people who struggle with punctuality, by integrating the confusing plethora of technologies needed to plan a journey and preventing tardiness (unlike existing scheduling, navigation, weather, and alarm services).

student self check-in application: allows students to check in and be marked present, tardy, or absent

Single Machine Scheduling algorithms: Shortest Processing Time (SPT), Earliest Due Date (EDD), Moore´s Algorithm. These 3 algorithms will minimise Mean Waiting Time, Maximum Tardiness and Number of Late Jobs, respectively.

A macOS menu bar app that takes over your screen to make sure you're never late to a meeting.

Bind on-the-fly query parameters to your models

This research proposes a novel order batching approach for warehouses to minimize total tardiness, considering category, weight, and fragility constraints. A Set-based Mayfly Algorithm (SBMA) is developed, adapting the Mayfly Algorithm to the discrete problem and leveraging swarming/mating behaviors to avoid local optima.

This page discusses my work automating tasks for UMRF Ventures. Below you can read about a web application that tracks call center agent statistics as well as another program that aims to optimize staffing throughout the day. I am currently working on a program which will automatically track tardies/absences from our clock-in system.

No description available

ファイル名の文字コードを指定しできるアーカイバ

INACTIVE - http://mzl.la/ghe-archive