Revolutionizing Personal Task Management: A Constraint Programming Approach to Optimizing Time

CSEF · 2023 Computational Systems & Analysis Third Award

Overview

Although digital calendars are prevalent, they often face limitations such as a rigid adherence to specific dates and inflexibility. Consequently, users may have to limit the variety and number of tasks they include. Other organizational methods, like to-do lists and project managers, have their own challenges: lists lack time information, and project managers can be overly complex, focusing on business applications. These issues render these methods unsuitable for individual users with busy schedules. Our initial solution employed a genetic algorithm that randomized initial conditions for time and bred schedules based on their "fitness." However, this method proved slow and inefficient. Our refined solution developed a novel engine using constraint programming to generate optimal schedules for tasks with specified date, time, and duration constraints. We implemented a proof of concept with a web user interface (UI) and supporting server infrastructure. The UI allows users to view their schedule in a calendar format, while a specially designed minimalistic language enables task input. The server infrastructure comprises a Firebase database, task solver services, and a task notification service. This implementation demonstrated the capability to solve intricate schedules and provide value to users. During the development of this refined solution, we discovered that complex schedules often necessitated more elaborate constraints. We re-engineered the engine from scratch, allowing for all types of constraints on various time periods, hierarchical tasks, task groups, and task relations. Additionally, we incorporated support for locations, task states, resources, margins, and points. The current system offers a simple and efficient solution to the challenges presented by digital calendars. We continue to enhance our program, with plans to add support for task repetition, interruption, local schedule adjustment, tags, and multi-person schedules. Furthermore, we intend to revamp the UX to include improved mobile functionality.

Source coverage

This record comes from a published award list, not a complete project archive. Its abstract comes from CSEF's public project showcase as archived by the Internet Archive before judging (https://web.archive.org/web/20230401224130/https://ca-csef.zfairs.com/showcase/ShowcaseInfo?f=838e60b7-ea75-46e8-865c-fde4864244b3); the version presented may differ.

Awards (1)

Competition history

  • CSEF 2023 Computational Systems & Analysis · Entry S0826

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Source: California Science & Engineering Fair public projects

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google