Library prosa.behavior.execution
Validity of Schedules of Arriving Jobs
Consider jobs with arrival times and any processor model.
Consider any schedule.
Scheduled jobs must belong to the given arrival sequence.
Definition jobs_come_from_arrival_sequence (arr_seq : arrival_sequence Job) :=
∀ j t,
scheduled_at sched j t →
arrives_in arr_seq j.
∀ j t,
scheduled_at sched j t →
arrives_in arr_seq j.
Jobs can execute only after they have arrived.
Further, suppose jobs have execution costs.
Completed jobs cannot execute.
Definition completed_jobs_dont_execute :=
∀ j t,
scheduled_at sched j t →
service sched j t < job_cost j.
∀ j t,
scheduled_at sched j t →
service sched j t < job_cost j.
We combine the above three properties into one composite validity constraint.