I need to implement a constraint that allocates N units of resource R to an activity.
In any point in time max T units are available for allocation.
(example: activity which requires 3 computers for the group, total available computers in school 10)
Possible ? How ?
Thanks
i think there are at least 2 variants:
Variant a) is easier to enter, but it can care only about 1 resource per activity.
Variant b) is maybe better; you can also see the "used" computer. but it is more difficult to enter.
a) go to fet -> data -> time constraints -> x -> max simultaneous in selected time slots.
select all activities that need a computer. select all time slots. allow max simultaneous as you have resources.
b) you can use room constraints for this. adding pseudo activities for each needed computer.
so you need to split it similar as the original activity. maybe call it subject "computer".
remove automatically added min days between activities constraints of that pseudo activities.
add same starting time constraint to the original activity and the pseudo activity.
add room new rooms. each computer need it one room name.
add room constraint to the pseudo subject "computer".
a) This will not work as each activity requires multiples of the resource - and there is no way
to allocate for each activity the right quantity.
b) Not sure... to my best understanding this will only work if named computers will be specified
for each activity - however if there is no identity to the computers, and they are all interchangeable
this variant will not do.
you don't need tell the teachers the name of the computer. But it is needed to limit the max resource.
it is like the car park close to a shop. each single car park slot hasn't got a name. But you can give them names like "park slot 1", "park slot 2", ... . So each time if a driver park his car in a slot you could say: he use "park slot x"; even the driver don't know that name. But overall: as soon as all park slot names are used, there is no free park slot left. So the resource is limited.
Lets assume 3 computers (rooms) "comp1","comp2","comp3"
Lets assume activity #1 needs 2 computers - then I need to add to it 2 pseudo activities one for room "comp1" and one from room "comp2".
Lets assume activity #2 needs 1 computer - then I need to add to it 1 pseudo activity, let say for room "comp1"
It will not be possible to schedule both activities in parallel - as the rooms are named.
Unless there is a way to tell FET there are 3 X "comp" rooms and have the pseudo activity ask for room "comp".
you are wrong.
you only need to add a roomS constraint for subject "computer" and allow room "computer1" and "computer2" and "computer3".
FET will automaticly choose the computer. So if "computer 1" and "computer 2" are already used, it will give "computer 3" to the second activity.
Cool! Implemented.
Works fine! Thanks!