Simple assembly line balancing problem type 2 by variable neighborhood strategy adaptive search: A case study garment industry
Jirasirilerd, Ganokgarn, Pitakaso, Rapeepan, Sethanan, Kanchana, Kaewman, Sasitorn, Sirirak, Worapot, Kosacka-Olejnik, Monika
Published in Journal of open innovation (01.03.2020)
Published in Journal of open innovation (01.03.2020)
Get full text
Journal Article
A Multiobjective Variable Neighborhood Strategy Adaptive Search to Optimize the Dynamic EMS Location–Allocation Problem
Sangkaphet, Ponglert, Pitakaso, Rapeepan, Sethanan, Kanchana, Nanthasamroeng, Natthapong, Pranet, Kiatisak, Khonjun, Surajet, Srichok, Thanatkij, Kaewman, Sasitorn, Kaewta, Chutchai
Published in Computation (01.06.2022)
Published in Computation (01.06.2022)
Get full text
Journal Article
An algorithm to manage transportation logistics that considers sabotage risk
Chomchalao, Chaiya, Kaewman, Sasitorn, Pitakaso, Rapeepan, Sethanan, Kanchana
Published in Administrative sciences (01.09.2018)
Published in Administrative sciences (01.09.2018)
Get full text
Journal Article
Adaptive large neighborhood search to solve multi-level scheduling and assignment problems in broiler farms
Praseeratasang, Natthanan, Pitakaso, Rapeepan, Sethanan, Kanchana, Kosacka-Olejnik, Monika, kaewman, Sasitorn, Theeraviriya, Chalermchat
Published in Journal of open innovation (2019)
Published in Journal of open innovation (2019)
Get full text
Journal Article
The most frequent closed sequence mining
Songram, Panida, Kaewman, Sasitorn
Published in The 6th International Conference on Networked Computing and Advanced Information Management (01.08.2010)
Get full text
Published in The 6th International Conference on Networked Computing and Advanced Information Management (01.08.2010)
Conference Proceeding