peakyfuckingblinder / Rostering_Prob

FO Project SS2v1 - DSAI HUST

Rostering problem

• There are 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.
• F(i): list of staffs rest days i.
• The maximum number of night shifts assigned to a specific staff is the smallest.

Collaborators

Name	Student ID	Mail
Le Duc Anh Tuan	20204929	[e-mail]
Hoang Gia Nguyen	20204889	[e-mail]
Hoang Long Vu	20204897	[e-mail]
Nguyen Huu Tuan Duy	20204907	[e-mail]

Announcements

All older announcements can be found in ANNOUNCEMENTS.md