@article{Suttipongkaset20141664,

title = {Delivery planning of water-treatment chemicals in vendor managed inventory context},

author = {Pongpol Suttipongkaset and Paveena Chaovalitwongse},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901505406&doi=10.4028%2fwww.scientific.net%2fAMR.931-932.1664&partnerID=40&md5=7564dc210de5c29387d4572f52bb0dce},

doi = {10.4028/www.scientific.net/AMR.931-932.1664},

year  = {2014},

date = {2014-01-01},

journal = {Advanced Materials Research},

volume = {931-932},

pages = {1664 – 1668},

note = {Cited by: 0},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Meesuptaweekoon2014135,

title = {Dynamic Vehicle Routing Problem with Multiple Depots},

author = {Kwankaew Meesuptaweekoon and Paveena Chaovalitwongse},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908547587&doi=10.4186%2fej.2014.18.4.135&partnerID=40&md5=acc985e07bb0a903885f0a0cbf4affef},

doi = {10.4186/ej.2014.18.4.135},

year  = {2014},

date = {2014-01-01},

journal = {Engineering Journal},

volume = {18},

number = {4},

pages = {135 – 149},

note = {Cited by: 13; All Open Access, Bronze Open Access, Green Open Access},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Pukcarnon201453,

title = {The can-order policy for one-warehouse r-retailer inventory system: A heuristic approach},

author = {Varaporn Pukcarnon and Paveena Chaovalitwongse and Naragain Phumchusri},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908504006&doi=10.4186%2fej.2014.18.4.53&partnerID=40&md5=a4e0b78a2c02a1cc88866df1a0714293},

doi = {10.4186/ej.2014.18.4.53},

issn = {01258281},

year  = {2014},

date = {2014-01-01},

journal = {Engineering Journal},

volume = {18},

number = {4},

pages = {53 – 72},

publisher = {Chulalongkorn University 1},

abstract = {We study an application of the can-order policy in one-warehouse n-retailer inventory systems, and propose a heuristic approach for setting the appropriate inventory policy. On the can-order policy, an order is triggered when a retailer’s inventory position reaches its must-order level. Then other retailers are examined whether their inventory reaches their can-order level, and if so they are filled by this order as well. Warehouse fulfills all involved retailers’ inventory to their order-up-to levels. The can-order policy is not only able to save the total system-wide cost from joint replenishment, but it is also simple to use. Computer simulation is utilized to preliminarily study and to determine the best-known solution. We propose a heuristic approach utilizing the decomposition technique, iterative procedure, and golden section search to obtain the satisfying total system-wide cost. This can save our computational time to find the appropriate inventory policy setting from the reduced search space. We found that the proposed heuristic approach performs very well with the average cost gap of less than 2% comparing to the best-known solution. Thus, the can-order policy can be very useful for such systems. © 2014 Chulalongkorn University 1. All rights reserved.},

note = {Cited by: 5; All Open Access, Bronze Open Access, Green Open Access},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{ArtChaovalitwongse2012277,

title = {Data mining framework to optimize the bid selection policy for competitively bid highway construction projects},

author = {W. Art Chaovalitwongse and Wanbin Wang and Trefor P. Williams and Paveena Chaovalitwongse},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84863377634&doi=10.1061%2f%28ASCE%29CO.1943-7862.0000386&partnerID=40&md5=7ee8a8f0fcf0ecc4eb965c62630ca34d},

doi = {10.1061/(ASCE)CO.1943-7862.0000386},

year  = {2012},

date = {2012-01-01},

journal = {Journal of Construction Engineering and Management},

volume = {138},

number = {2},

pages = {277 – 286},

note = {Cited by: 36},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Jungwattanakit2009358,

title = {A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria},

author = {Jitti Jungwattanakit and Manop Reodecha and Paveena Chaovalitwongse and Frank Werner},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-52049090864&doi=10.1016%2fj.cor.2007.10.004&partnerID=40&md5=1de4940be1e7f8d02b926e14139a86d6},

doi = {10.1016/j.cor.2007.10.004},

year  = {2009},

date = {2009-01-01},

journal = {Computers and Operations Research},

volume = {36},

number = {2},

pages = {358 – 378},

note = {Cited by: 112},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Jungwattanakit2008354,

title = {Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria},

author = {Jitti Jungwattanakit and Manop Reodecha and Paveena Chaovalitwongse and Frank Werner},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-42449153783&doi=10.1007%2fs00170-007-0977-0&partnerID=40&md5=d2367e1ec8b8c92d670e8bc6df201a0f},

doi = {10.1007/s00170-007-0977-0},

year  = {2008},

date = {2008-01-01},

journal = {International Journal of Advanced Manufacturing Technology},

volume = {37},

number = {3-4},

pages = {354 – 370},

note = {Cited by: 106},

keywords = {},

pubstate = {published},

tppubtype = {article}

}