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

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

2009-06-07

arxiv.org/abs/0906.1341v1

Proceedings of the 33rd American Romanian Academy of Arts and Sciences' International Congress, vol. 1, pp. 59-63, Sibiu, Roma

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370087