We deal here with a multi-machine scheduling problem with non idling constraints, i.e constraints which forbids the interruption of the use of the processors. We reformulate the problem, while using specific pyramidal profile functions, next get a min-max feasibility criterion and finally derive exact polynomial algorithms for both the feasibility problem and the makespan optimization problem.