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

Madalina Andreica (1) , Mugurel Ionut Andreica (2) , Angela Andreica (3)

1 The Department of Economic Informatics and Cybernetics / Departamentul de Informatică şi Cibernetică Economică
2 Parallel and Distributed Systems Laboratory [Bucarest]
3 Management and Finances Center

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.

Mots clés: Activity scheduling

Domaines: Algorithme et structure de données [cs.DS]

Madalina Andreica, Mugurel Ionut Andreica, Angela Andreica. Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains. Proceedings of the 33rd American Romanian Academy of Arts and Sciences' International Congress (ISBN: 978-2-553-01433-8), Jun 2009, Sibiu, Romania. pp.59-63. ⟨hal-00468780⟩