IN A RESOURCE CONSTRAINT SCHEDULING

problem, let Pl$,$ P$2.$ P$3,$ and P$4$ denote the

NUMBERS OF PERSONNEL ASSIGNED TO EACH OF

FOUR TASKS. IN THIS PROBLEM, THE CONSTRAINT

IS THAT NO MORE THAN $7$ PERSONNEL ARE

ASSIGNED IN TOTAL AND CAN BE WRITTEN AS

Atmost $\{$:$7,P{l}_1,P_2,P_3,P_4).$ I f each Variable

HAS THE dOMAIN $\{1,3,5,7\},$ THEN

A$)$ THE Atmost constraint IS SATISAED

B$)$ THE Atmost constraint is nOt sAtISFEed

c$)$ We NeED TO DeLETE VALUES $5,$ AND $7$ FROM EACH

VARIABLE'S DOMAIN TO MAKE IT CONSISTENT

D$)$ THIS RESOURCE CONSTRAINT CAN NEVER BE SATISAED