default search action
Jirachai Buddhakulsomsiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Nguyen Trong Tri Duc, Jirachai Buddhakulsomsiri
, Pham Duc Tai
A mathematical model for the integrated problem of production network design and inventory positioning. Comput. Ind. Eng. 191: 110170 (2024) - [j13]Kanokwan Singha
Market Basket Analysis of a Health Food Store in Thailand: A Case Study. Int. J. Knowl. Syst. Sci. 15: 1-14 (2024) - 2022
- [j12]Nguyen Trong Tri Duc
Inventory Positioning in Supply Chain Network: A Service-Oriented Approach. IEEE Access 10: 92986-93002 (2022) - [j11]Pham Duc Tai, Jirachai Buddhakulsomsiri, Truong Ton Hien Duc
Revisiting measurement of compound bullwhip with asymmetric reference price. Comput. Ind. Eng. 172(Part): 108510 (2022) - [j10]Tai Duc Pham
Determining (s, S) Inventory Policy for Healthcare System: A Case Study of a Hospital in Thailand. Int. J. Knowl. Syst. Sci. 13(1): 1-18 (2022) - [j9]Nguyen Trong Tri Duc
A Markovian approach to modeling a periodic order-up-to-level policy under stochastic discrete demand and lead time with lost sales. Int. Trans. Oper. Res. 29(2): 1132-1158 (2022) - [j8]Pham Duc Tai
Value of information sharing in supply chain under promotional competition. Int. Trans. Oper. Res. 29(4): 2649-2681 (2022) - 2020
- [c2]Jirasak Ji, Warut Pannakkong, Pham Duc Tai, Chawalit Jeenanunta
Motion Time Study with Convolutional Neural Network. IUKM 2020: 249-258
2010 – 2019
- 2019
- [j7]Pham Duc Tai
Measure of bullwhip effect in supply chain with price-sensitive and correlated demand. Comput. Ind. Eng. 127: 408-419 (2019) - [c1]Pham Duc Tai
Information Sharing with Multiple Customer Segmentations. IEEM 2019: 876-880 - 2018
- [j6]Jirachai Buddhakulsomsiri
Prediction models of starch content in fresh cassava roots for a tapioca starch manufacturer in Thailand. Comput. Electron. Agric. 154: 296-303 (2018) - 2015
- [j5]Jirachai Buddhakulsomsiri
Corrigendum to 'Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting' and 'Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting' [Eur. J. Oper. Res 175 (2006) 279-295, 178 (2007) 374-390]. Eur. J. Oper. Res. 240(2): 602 (2015) - 2012
- [j4]Parthana Parthanadee
A study of replacement rules for a parallel fleet replacement problem based on user preference utilization pattern and alternative fuel considerations. Comput. Ind. Eng. 63(1): 46-57 (2012)
2000 – 2009
- 2009
- [j3]Jirachai Buddhakulsomsiri
Sequential pattern mining algorithm for automotive warranty data. Comput. Ind. Eng. 57(1): 137-147 (2009) - 2007
- [j2]Jirachai Buddhakulsomsiri
Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. Eur. J. Oper. Res. 178(2): 374-390 (2007) - 2006
- [j1]Jirachai Buddhakulsomsiri
Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. Eur. J. Oper. Res. 175(1): 279-295 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: