default search action
Tay Jin Chua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c14]Wei Qing Lee, Tay Jin Chua, Kumar Katru Ravi, Tian Xiang Cai:
Implementing Distribution Requirement Planning and Scheduling System for Lens Manufacturing Company. IEEM 2022: 701-705 - 2020
- [c13]Sisui Ngoh, Tay Jin Chua, Tian Xiang Cai, Kumar Katru Ravi, Beng Kwee Clement Tan, Xinlin Lin, Boon Yang Martin Choo, Wei Qing Lee:
Implementing Real-time Scheduling System for a Precision Engineering Company in Singapore. IEEM 2020: 736-740
2010 – 2019
- 2018
- [j8]Byung Jun Joo, Sang-Oh Shim, Tay Jin Chua, Tian Xiang Cai:
Multi-level job scheduling under processing time uncertainty. Comput. Ind. Eng. 120: 480-487 (2018) - 2017
- [j7]Shyam Sundar, Ponnuthurai N. Suganthan, Tay Jin Chua, Tian Xiang Cai, Chong Chin Soon:
A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput. 21(5): 1193-1202 (2017) - 2016
- [j6]Kai-Zhou Gao, Ponnuthurai Nagaratnam Suganthan, Quan-Ke Pan, Tay Jin Chua, Chin-Soon Chong, Tian Xiang Cai:
An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst. Appl. 65: 52-67 (2016) - [j5]Kai-Zhou Gao, Ponnuthurai N. Suganthan, Quan-Ke Pan, Tay Jin Chua, Tian Xiang Cai, Chin-Soon Chong:
Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J. Intell. Manuf. 27(2): 363-374 (2016) - 2015
- [j4]Kai-Zhou Gao, Ponnuthurai Nagaratnam Suganthan, Tay Jin Chua, Chin-Soon Chong, Tian Xiang Cai, Quan-Ke Pan:
A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst. Appl. 42(21): 7652-7663 (2015) - 2014
- [j3]Kai-Zhou Gao, Ponnuthurai N. Suganthan, Quan-Ke Pan, Tay Jin Chua, Tian Xiang Cai, Chin-Soon Chong:
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf. Sci. 289: 76-90 (2014) - [p1]Jürgen Sauer, Tay Jin Chua:
Fuzzy Predictive and Reactive Scheduling. Soft Computing for Business Intelligence 2014: 281-297 - 2013
- [c12]Kai-Zhou Gao, Ponnuthurai N. Suganthan, Tay Jin Chua:
An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem. CISched 2013: 9-13 - [c11]Kaizhou Gao, Ponnuthurai Nagaratnam Suganthan, Tay Jin Chua, Tian Xiang Cai, Chin-Soon Chong:
Hybrid discrete harmony search algorithm for scheduling re-processing problem in remanufacturing. GECCO 2013: 1261-1268 - [c10]Shyam Sundar, Ponnuthurai N. Suganthan, Tay Jin Chua:
A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing. ICAISC (2) 2013: 593-602 - 2012
- [c9]Kaizhou Gao, Ponnuthurai Nagaratnam Suganthan, Tay Jin Chua:
Pareto-based discrete harmony search algorithm for flexible job shop scheduling. ISDA 2012: 953-956 - [c8]Kaizhou Gao, Ponnuthurai Nagaratnam Suganthan, Tay Jin Chua:
Discrete Harmony Search Algorithm for Dynamic FJSSP in Remanufacturing Engineering. SEMCCO 2012: 9-16 - [c7]Srinjoy Ganguly, Arkabandhu Chowdhury, Swahum Mukherjee, Ponnuthurai N. Suganthan, Swagatam Das, Tay Jin Chua:
A Hybrid Discrete Differential Evolution Algorithm for Economic Lot Scheduling Problem with Time Variant Lot Sizing. SOCO 2012: 1-12 - 2011
- [j2]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Tay Jin Chua:
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12): 2455-2468 (2011)
2000 – 2009
- 2009
- [c6]Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Tay Jin Chua, Mohammed Abdullah Al-Hajri:
Differential Evolution Algorithms for the Generalized Assignment problem. IEEE Congress on Evolutionary Computation 2009: 2606-2613 - 2008
- [c5]Tay Jin Chua, Tian Xiang Cai, Joyce Mei Wan Low:
Dynamic operations and manpower scheduling for high-mix, low-volume manufacturing. ETFA 2008: 54-57 - 2007
- [c4]Feng-Yu Wang, Tay Jin Chua, Tian Xiang Cai, L. S. Chai:
Common capacity modelling for multi-site planning: case studies. ETFA 2007: 336-343 - [c3]Tay Jin Chua, Tian Xiang Cai, Xiao-Feng Yin:
A heuristic approach for scheduling multi-chip packages for semiconductor backend assembly. ETFA 2007: 1024-1030 - 2006
- [c2]Tay Jin Chua, F. Y. Wang, Tian Xiang Cai, Xiao-Feng Yin:
A Heuristics-based Advanced Planning and Scheduling System with Bottleneck Scheduling Algorithm. ETFA 2006: 240-247 - 2004
- [j1]Xiao-Feng Yin, Tay Jin Chua, Feng-Yu Wang, Ming-Wei Liu, Tian Xiang Cai, Wen-Jing Yan, Chin-Soon Chong, Ju-Ping Zhu, Mei-Yoke Lam:
A rule-based heuristic finite capacity scheduling system for semiconductor backend assembly. Int. J. Comput. Integr. Manuf. 17(8): 733-749 (2004) - 2002
- [c1]William Liu, Tay Jin Chua, J. Larn, Feng-Yu Wang, Tian Xiang Cai, Xiao-Feng Yin:
APS, ERP and MES systems integration for semiconductor backend assembly. ICARCV 2002: 1403-1408
Coauthor Index
aka: Ponnuthurai Nagaratnam Suganthan
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-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint