Skip to content
This repository has been archived by the owner on Jun 7, 2022. It is now read-only.
/ RP Public archive

RP - FO Project S2T1, DSAI HUST

License

Notifications You must be signed in to change notification settings

tuanlda78202/RP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

RP - Rostering Problem

GitHub commit activity GitHub last commit GitHub repo size

We have a commpany with N staffs 1,2,..., N needs to be assigned to work shifts for days 1, 2, ..., D. Each day is divided into four shifts: morning, noon, afternoon, and night. Each day, an staff can only work one shift at most. If you work the night shift the day before, you can rest the next day. Each shift in each day has at least staffs and at most staffs.

Denote F(i) - list of staffs rest days i. Optimizing to finding maximum number of night shifts assigned to a specific staff is the smallest.

Collaborators

Name Student ID Mail
Le Duc Anh Tuan 20204929 tuan.lda204929@sis.hust.edu.vn
Hoang Gia Nguyen 20204889 nguyen.hg204889@sis.hust.edu.vn
Hoang Long Vu 20204897 vu.hl204897@sis.hust.edu.vn
Nguyen Huu Tuan Duy 20204907 duy.nht204907@sis.hust.edu.vn

Announcements

All older announcements can be found in ANNOUNCEMENTS.md