Show simple item record

dc.contributor.advisorPhan Nguyen Ky, Phuc
dc.contributor.authorNguyen Thi Ngan, Ha
dc.date.accessioned2020-10-17T02:07:24Z
dc.date.available2020-10-17T02:07:24Z
dc.date.issued2019
dc.identifier.other022005150
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/3593
dc.description.abstractSupermarket Staffs Scheduling Problem (SSSP) is assigning a number of staffs to several shifts in order to satisfy supermarket‟s demand. The objective of this study is to minimize the overall cost of supermarkets and optimize the coordination of scheduling for supermarket staffs to satisfy customers‟ requirements while taking into the consideration the government‟s rules and supermarket‟s standards. The study is divided into two parts. The first part presents a proposed mathematical model based on the idea of a multi – commodity network flow model. The second part is about the application of it in a case study of Co.opmart Supermarket. The model can be solved by CPLEX software to find out the optimal solution. Keywords: Supermarket Staffs Scheduling Problem, the overall cost, the coordination of scheduling, multi – commodity network flow modelen_US
dc.language.isoen_USen_US
dc.publisherInternational University - HCMCen_US
dc.subjectSupermarket staffs scheduling problemen_US
dc.titleSupermarket staffs scheduling problem: A case study of Co.opmart supermarketen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record