As of today, human resource management is an inherent part of any manufacturing systems. This includes scheduling, assignment, etc. of the staff. The efficient and optimum solution to these problems is quite important as it may save a considerable amount of cost and efforts. The chapter reviews several scheduling cases as well as algorithms addressing the associated problems. The non-preemptive scheduling workflow planning and scheduling process in automotive manufacturing as well as genetic algorithms and tabu search methods and mixed integer linear programming method for matching and assignment approach considering flexibility of assignment of workforce have been described. The complex applications of multi-resource scheduling problem using Dijkstra and multi-ant colony optimization algorithms, technician routing and scheduling problem using genetic algorithm and particle swarm optimization, memetic global and local search, and greedy algorithm for hybrid flow shop with multiprocessor task scheduling problem have also been addressed. In addition, single objective as well as multi-objective multi-period job assignment and scheduling problem solution using integer programming as well as non-dominated sorting genetic algorithm.