Publication: A profit maximization lot-sizing and supplier selection problem under price discount
| dc.contributor.author | Sakada Srun | en_US |
| dc.contributor.author | Thanakorn Naenna | en_US |
| dc.contributor.other | Mahidol University | en_US |
| dc.date.accessioned | 2020-06-02T04:28:00Z | |
| dc.date.available | 2020-06-02T04:28:00Z | |
| dc.date.issued | 2020-01-01 | en_US |
| dc.description.abstract | © 2020 IEEE. This research addresses the development of integrated inventory lot-sizing and supplier selection problem in supply chain management, in which a buyer firm that has limited budget and warehouse space wants to procure multiple products from a group of potential suppliers and sell to their customer. In particular, the suppliers may provide different quantity discount scheme, ordering cost, and transportation cost. The problem is modelled as mixed integer linear programming (MILP) by incorporating quantity discount. To overcome the large scale problem, Genetic Algorithm (GA) is developed in next phase. The comparison was conducted on both MILP and GA. The results showed that GA has better performance in term of solution feasibility and computational time. | en_US |
| dc.identifier.citation | KST 2020 - 2020 12th International Conference on Knowledge and Smart Technology. (2020), 24-29 | en_US |
| dc.identifier.doi | 10.1109/KST48564.2020.9059385 | en_US |
| dc.identifier.other | 2-s2.0-85084043044 | en_US |
| dc.identifier.uri | https://repository.li.mahidol.ac.th/handle/123456789/56159 | |
| dc.rights | Mahidol University | en_US |
| dc.rights.holder | SCOPUS | en_US |
| dc.source.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084043044&origin=inward | en_US |
| dc.subject | Computer Science | en_US |
| dc.subject | Decision Sciences | en_US |
| dc.title | A profit maximization lot-sizing and supplier selection problem under price discount | en_US |
| dc.type | Conference Paper | en_US |
| dspace.entity.type | Publication | |
| mu.datasource.scopus | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084043044&origin=inward | en_US |
