Employee scheduling planning is a problem faced by many companies that have many employees. The traditional scheduling process is carried out by recording employee data one by one and collecting them in the form of an Excel report which is inefficient and takes a lot of time. Apart from that, to match the schedules, management needs to take great pains to arrange shift times so that they match and do not conflict between one shift schedule and another shift schedule. This method is very inefficient because it takes a long time if it turns out there is an error in the schedule. A popular method for making schedules is to use a genetic algorithm which is able to arrange schedules using a random approach to find schedule solutions that are most effective and do not collide with each other. Research was conducted to create a schedule from a list of existing employees. As a result, the schedule produced using a genetic algorithm was proven to be more optimal and faster.