Defination

• Manpower scheduling problem is defined as “the problem of optimally matching available labor resources to the needs for labor of an organization considering all applicable constraints”.

• Manpower scheduling, workforce scheduling, employee timetabling, staff scheduling, and crew-rostering are different names for the same problem.

• The workforce scheduling problem is classified as NP-complete, which can not be solved in polynomial time but whether a given solution is right can be checked in polynomial.