Implementation of Hungarian Algorithms to Optimize the Assignments of Chefs at Roy Catering

This research tries to optimize the assignment time of the chefs. An executive chef assigns tasks to his subordinates on each allocation, including the task of cutting meat, cutting vegetables, cutting fruit, making pudding, and making rice. Every chef has different abilities and backgrounds for each task given. We found that some chefs got task not suitable with their capabilities. It caused lack of time efficiency Limited resources make this business need to require chefs with fast work capabilities. To solve this problem we recommend implementation of Hungarian algorithm. The results of this study there are two optimal assignment alternatives with a difference in production time of 30 minutes to 40 minutes for 2000 packages.