Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains

TL;DR

This paper introduces efficient, exact algorithms for various constrained activity scheduling problems in time and space domains, utilizing dynamic programming and greedy methods to optimize multiple objectives.

Contribution

It presents novel, efficient algorithms for constrained activity scheduling problems, providing exact solutions based on dynamic programming and greedy techniques.

Findings

Algorithms compute optimal solutions efficiently.

Applicable to both time and space scheduling problems.

Demonstrates effectiveness of dynamic programming and greedy methods.

Abstract

In this paper we consider several constrained activity scheduling problems in the time and space domains, like finding activity orderings which optimize the values of several objective functions (time scheduling) or finding optimal locations where certain types of activities will take place (space scheduling). We present novel, efficient algorithmic solutions for all the considered problems, based on the dynamic programming and greedy techniques. In each case we compute exact, optimal solutions.