Optimizing factory workers work shifts scheduling using local antimagic vertex coloring

HIGHLIGHTS

• What: The Table1 was constructed by Factory workers work shifts Scheduling assignment implementing local antimagic vertex coloring in this concept vertices considered as the work shifts totally 8 work shifts, edges considered as workers totally 40 workers needed but in this case only enough 20 workers that 20 egdes are considered as workers and vertex weight considered as time schedule for the work shifts. The research aims to analyze the fundamental principles of a specific methodology, assess its practical consequences in the context of arranging workers to work shifts. The authors will compare their approaches and prove . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.