default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKuo-Ching Ying
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j77]Kuo-Ching Ying, Pourya Pourhejazy
, Po-Jui Fu:
Correction: N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling. Ann. Oper. Res. 332(1): 1311-1312 (2024)- [j76]Kuo-Ching Ying, Pourya Pourhejazy, Xin-Yi Huang:
Revisiting the development trajectory of parallel machine scheduling. Comput. Oper. Res. 168: 106709 (2024) - 2023
- [j75]Kuo-Ching Ying, Pourya Pourhejazy, Ya-Hsuan Huang:
Tailored Iterated Greedy metaheuristic for a scheduling problem in metal 3D printing. Adv. Eng. Softw. 186: 103546 (2023) - [j74]Pourya Pourhejazy, Chen-Yang Cheng, Kuo-Ching Ying, Nguyen Hoai Nam:
Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups. Ann. Oper. Res. 322(1): 125-146 (2023) - [j73]Kuo-Ching Ying, Shih-Wei Lin:
Minimizing makespan in two-stage assembly additive manufacturing: A reinforcement learning iterated greedy algorithm. Appl. Soft Comput. 138: 110190 (2023) - [j72]Kuo-Ching Ying, Pourya Pourhejazy, Chen-Yang Cheng, Ren-Siou Syu:
Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times. Int. J. Prod. Res. 61(1): 258-281 (2023) - [j71]Kuo-Ching Ying, Shih-Wei Lin:
Reinforcement learning iterated greedy algorithm for distributed assembly permutation flowshop scheduling problems. J. Ambient Intell. Humaniz. Comput. 14(8): 11123-11138 (2023) - 2022
- [j70]Kuo-Ching Ying, Shih-Wei Lin:
Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic. Comput. Ind. Eng. 169: 108238 (2022) - [j69]Kuo-Ching Ying, Fabio Fruggiero, Pourya Pourhejazy, Bo-Yun Lee:
Adjusted Iterated Greedy for the optimization of additive manufacturing scheduling problems. Expert Syst. Appl. 198: 116908 (2022) - 2021
- [j68]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Shi-Yao Huang:
New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times. Appl. Soft Comput. 104: 107229 (2021) - [j67]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Chen-Fang Lin:
Unsupervised Learning-based Artificial Bee Colony for minimizing non-value-adding operations. Appl. Soft Comput. 105: 107280 (2021) - [j66]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Yi-Hsiu Liao:
New benchmark algorithms for No-wait Flowshop Group Scheduling Problem with Sequence-Dependent Setup Times. Appl. Soft Comput. 111: 107705 (2021) - [j65]Kuo-Ching Ying, Pourya Pourhejazy, Chen-Yang Cheng, Zong-Ying Cai:
Deep learning-based optimization for motion planning of dual-arm assembly robots. Comput. Ind. Eng. 160: 107603 (2021) - [j64]Shih-Wei Lin, Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying:
Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems. Expert Syst. Appl. 165: 113837 (2021) - [j63]Shih-Wei Lin, Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Chia-Hui Lee:
New benchmark algorithm for hybrid flowshop scheduling with identical machines. Expert Syst. Appl. 183: 115422 (2021) - [j62]Shih-Wei Lin, Kuo-Ching Ying:
Minimising makespan in job-shops with deterministic machine availability constraints. Int. J. Prod. Res. 59(14): 4403-4415 (2021) - 2020
- [j61]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Shu-Fen Li, Chieh-Wen Chang:
Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times. IEEE Access 8: 74065-74082 (2020) - [j60]Chen-Yang Cheng, Shih-Wei Lin, Pourya Pourhejazy, Kuo-Ching Ying, Jia-Wen Zheng:
Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops. IEEE Access 8: 142065-142075 (2020) - [j59]Chen-Yang Cheng, Shih-Wei Lin, Pourya Pourhejazy, Kuo-Ching Ying, Shu-Fen Li, Ying-Chun Liu:
Greedy-Based Non-Dominated Sorting Genetic Algorithm III for Optimizing Single-Machine Scheduling Problem With Interfering Jobs. IEEE Access 8: 142543-142556 (2020) - [j58]Pourya Pourhejazy, Shih-Wei Lin, Chen-Yang Cheng, Kuo-Ching Ying, Pei-Yu Lin:
Improved Beam Search for Optimizing No-Wait Flowshops With Release Times. IEEE Access 8: 148100-148124 (2020) - [j57]Kuo-Ching Ying, Shih-Wei Lin:
Solving no-wait job-shop scheduling problems using a multi-start simulated annealing with bi-directional shift timetabling algorithm. Comput. Ind. Eng. 146: 106615 (2020)
2010 – 2019
- 2019
- [j56]Kuo-Ching Ying, Shih-Wei Lin, Chien-Yi Huang, Memphis Liu, Chia-Tien Lin:
Solving the Mask Data Preparation Scheduling Problem Using Meta-Heuristics. IEEE Access 7: 24192-24203 (2019) - [j55]Chen-Yang Cheng, Shu-Fen Li, Kuo-Ching Ying, Yu-Hsi Liu:
Scheduling Jobs of Two Competing Agents on a Single Machine. IEEE Access 7: 98702-98714 (2019) - [j54]Shih-Wei Lin, Kuo-Ching Ying, Wen-Jie Wu, Chen-Yang Cheng:
Single Machine Job Sequencing With a Restricted Common Due Window. IEEE Access 7: 148741-148755 (2019) - [j53]Kuo-Ching Ying, Chen-Yang Cheng, Shih-Wei Lin, Chia-Yang Hung:
Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems. IEEE Access 7: 152998-153011 (2019) - [j52]Shih-Wei Lin, Kuo-Ching Ying:
Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. Comput. Ind. Eng. 128: 1-7 (2019) - [j51]Chen-Yang Cheng, Kuo-Ching Ying, Shu-Fen Li, Ya-Chu Hsieh:
Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. Comput. Ind. Eng. 130: 338-347 (2019) - [j50]Chen-Yang Cheng, Kuo-Ching Ying, Hsia-Hsiang Chen, Hsiao-Shan Lu:
Minimising makespan in distributed mixed no-idle flowshops. Int. J. Prod. Res. 57(1): 48-60 (2019) - [j49]Chien-Yi Huang, Kuo-Ching Ying:
Intelligent parametric design for a multiple-quality-characteristic glue-dispensing process. J. Intell. Manuf. 30(5): 2291-2305 (2019) - 2018
- [j48]Chung-Cheng Jason Lu, Shih-Wei Lin, Hui-Ju Chen, Kuo-Ching Ying:
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach. IEEE Access 6: 2859-2870 (2018) - [j47]Shih-Wei Lin, Chien-Yi Huang, Kuo-Ching Ying, Dar-Lun Chen:
Decreasing the System Testing Makespan in a Computer Manufacturing Company. IEEE Access 6: 16464-16473 (2018) - [j46]Kuo-Ching Ying, Chung-Cheng Jason Lu, Shih-Wei Lin:
Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints. IEEE Access 6: 30702-30713 (2018) - [j45]Shih-Wei Lin, Chung-Cheng Jason Lu, Kuo-Ching Ying:
Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop. IEEE Access 6: 78666-78677 (2018) - [j44]Chen-Yang Cheng, Kuo-Ching Ying, Hsia-Hsiang Chen, Jia-Xian Lin:
Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities. Comput. Ind. Eng. 117: 164-170 (2018) - [j43]Kuo-Ching Ying, Shih-Wei Lin:
Minimizing makespan for no-wait flowshop scheduling problems with setup times. Comput. Ind. Eng. 121: 73-81 (2018) - [j42]Kuo-Ching Ying, Shih-Wei Lin:
Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Syst. Appl. 92: 132-141 (2018) - 2017
- [j41]Kuo-Ching Ying, Shih-Wei Lin:
Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms. IEEE Access 5: 15694-15705 (2017) - [j40]Shih-Wei Lin, Kuo-Ching Ying:
Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan. IEEE Access 5: 15791-15799 (2017) - [j39]Kuo-Ching Ying, Shih-Wei Lin, Chen-Yang Cheng, Cheng-Ding He:
Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Comput. Ind. Eng. 110: 413-423 (2017) - [j38]Kuo-Ching Ying, Shih-Wei Lin, Chung-Cheng Jason Lu:
Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window. Int. J. Prod. Res. 55(6): 1707-1719 (2017) - [j37]Kuo-Ching Ying, Yi-Ju Tsai:
Minimising total cost for training and assigning multiskilled workers in seru production systems. Int. J. Prod. Res. 55(10): 2978-2989 (2017) - 2016
- [j36]Kuo-Ching Ying, Chung-Cheng Jason Lu, Jhao-Cheng Chen:
Exact algorithms for single-machine scheduling problems with a variable maintenance. Comput. Ind. Eng. 98: 427-433 (2016) - [j35]Shih-Wei Lin, Kuo-Ching Ying:
Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Comput. Ind. Eng. 99: 202-209 (2016) - [j34]Kuo-Ching Ying, Shih-Wei Lin, Wen-Jie Wu:
Self-adaptive ruin-and-recreate algorithm for minimizing total flow time in no-wait flowshops. Comput. Ind. Eng. 101: 167-176 (2016) - 2015
- [j33]Shih-Wei Lin, Kuo-Ching Ying:
Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness. Appl. Soft Comput. 30: 462-474 (2015) - [j32]Kuo-Ching Ying:
Scheduling the two-machine flowshop to hedge against processing time uncertainty. J. Oper. Res. Soc. 66(9): 1413-1425 (2015) - 2014
- [j31]Chung-Cheng Jason Lu, Shih-Wei Lin, Kuo-Ching Ying:
Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times. Appl. Soft Comput. 23: 144-151 (2014) - [j30]Chung-Cheng Jason Lu, Kuo-Ching Ying, Shih-Wei Lin:
Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times. Comput. Ind. Eng. 74: 102-110 (2014) - [j29]Shih-Wei Lin, Kuo-Ching Ying:
ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Comput. Oper. Res. 51: 172-181 (2014) - [j28]Shih-Wei Lin, Kuo-Ching Ying:
Minimizing shifts for personnel task scheduling problems: A three-phase algorithm. Eur. J. Oper. Res. 237(1): 323-334 (2014) - [j27]Kuo-Ching Ying, Shih-Wei Lin:
Efficient wafer sorting scheduling using a hybrid artificial immune system. J. Oper. Res. Soc. 65(2): 169-179 (2014) - 2013
- [j26]Shih-Wei Lin, Kuo-Ching Ying, Chien-Yi Huang:
Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning. Comput. Oper. Res. 40(5): 1186-1195 (2013) - [j25]Shih-Wei Lin, Kuo-Ching Ying:
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. Comput. Oper. Res. 40(6): 1625-1647 (2013) - [j24]Shih-Wei Lin, Kuo-Ching Ying:
Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm. J. Oper. Res. Soc. 64(2): 293-311 (2013) - 2012
- [j23]Shih-Wei Lin, Kuo-Ching Ying, Chou-Yuan Lee, Zne-Jung Lee:
An intelligent algorithm with feature selection and decision rules applied to anomaly intrusion detection. Appl. Soft Comput. 12(10): 3285-3290 (2012) - [j22]Chung-Cheng Jason Lu, Shih-Wei Lin, Kuo-Ching Ying:
Robust scheduling on a single machine to minimize total flow time. Comput. Oper. Res. 39(7): 1682-1691 (2012) - [j21]Kuo-Ching Ying, Zne-Jung Lee, Shih-Wei Lin:
Makespan minimization for scheduling unrelated parallel machines with setup times. J. Intell. Manuf. 23(5): 1795-1803 (2012) - 2011
- [j20]Kuo-Ching Ying, Shih-Wei Lin, Zne-Jung Lee, I-Lin Lee:
A novel function approximation based on robust fuzzy regression algorithm model and particle swarm optimization. Appl. Soft Comput. 11(2): 1820-1826 (2011) - [j19]Shih-Wei Lin, Zne-Jung Lee, Kuo-Ching Ying, Chung-Cheng Jason Lu:
Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. Comput. Oper. Res. 38(5): 809-815 (2011) - [j18]Hui-Miao Cheng, Kuo-Ching Ying:
Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times. Expert Syst. Appl. 38(12): 15517-15522 (2011) - [j17]Shih-Wei Lin, Zne-Jung Lee, Kuo-Ching Ying, Rong-Ho Lin:
Meta-heuristic algorithms for wafer sorting scheduling problems. J. Oper. Res. Soc. 62(1): 165-174 (2011) - 2010
- [j16]Chou-Yuan Lee, Zne-Jung Lee, Shih-Wei Lin, Kuo-Ching Ying:
An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Appl. Intell. 32(1): 88-95 (2010) - [j15]Kuo-Ching Ying, Shih-Wei Lin, Chien-Yi Huang:
Corrigendum "Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic" [Experts Systems with Applications 36 (3P2) (2009) 7087-7092]. Expert Syst. Appl. 37(2): 1804 (2010) - [j14]Kuo-Ching Ying, Shih-Wei Lin, Zne-Jung Lee, Yen-Tim Lin:
An ensemble approach applied to classify spam e-mails. Expert Syst. Appl. 37(3): 2197-2201 (2010) - [j13]Kuo-Ching Ying, Hui-Miao Cheng:
Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Syst. Appl. 37(4): 2848-2852 (2010)
2000 – 2009
- 2009
- [j12]Shih-Wei Lin, Kuo-Ching Ying, Zne-Jung Lee:
Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times. Comput. Oper. Res. 36(4): 1110-1121 (2009) - [j11]Shih-Wei Lin, Zne-Jung Lee, Kuo-Ching Ying, Chou-Yuan Lee:
Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst. Appl. 36(2): 1505-1512 (2009) - [j10]Kuo-Ching Ying, Shih-Wei Lin:
Raising the hit rate for wafer fabrication by a simple constructive heuristic. Expert Syst. Appl. 36(2): 2894-2900 (2009) - [j9]Hui-Miao Cheng, Kuo-Ching Ying:
The causality of hourly price-volume relationship: An empirical study of mini Taiwan exchange futures. Expert Syst. Appl. 36(3): 4896-4899 (2009) - [j8]Hui-Miao Cheng, Kuo-Ching Ying:
Testing the significance of solar term effect in the Taiwan stock market. Expert Syst. Appl. 36(3): 6140-6144 (2009) - [j7]Kuo-Ching Ying, Shih-Wei Lin, Chien-Yi Huang:
Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst. Appl. 36(3): 7087-7092 (2009) - [j6]Kuo-Ching Ying:
An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. J. Oper. Res. Soc. 60(6): 810-817 (2009) - 2008
- [j5]Kuo-Ching Ying:
Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm. Comput. Ind. Eng. 55(2): 494-502 (2008) - [j4]Shih-Wei Lin, Kuo-Ching Ying, Shih-Chieh Chen, Zne-Jung Lee:
Particle swarm optimization for parameter determination and feature selection of support vector machines. Expert Syst. Appl. 35(4): 1817-1824 (2008) - [j3]Shih-Wei Lin, Kuo-Ching Ying:
A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. J. Oper. Res. Soc. 59(8): 1109-1119 (2008) - [p1]Zne-Jung Lee, Shih-Wei Lin, Kuo-Ching Ying:
A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date. Metaheuristics for Scheduling in Industrial and Manufacturing Applications 2008: 91-103 - 2007
- [j2]Shih-Wei Lin, Shuo-Yan Chou, Kuo-Ching Ying:
A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date. Eur. J. Oper. Res. 177(2): 1294-1301 (2007) - [c3]Zne-Jung Lee, Chen-Chia Chuang, Kuo-Ching Ying:
An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date. KES (2) 2007: 689-695 - 2006
- [c2]Shih-Wei Lin, Kuo-Ching Ying, Zne-Jung Lee, Fu Hsung Hsi:
Applying Simulated Annealing Approach for Capacitated Vehicle Routing Problems. SMC 2006: 639-644 - [c1]Shih-Wei Lin, Kuo-Ching Ying, Zne-Jung Lee, Hong-Sheng Chen:
Vehicle Routing Problems with Time Windows Using Simulated Annealing. SMC 2006: 645-650 - 2004
- [j1]Kuo-Ching Ying, Ching-Jong Liao:
An ant colony system for permutation flow-shop sequencing. Comput. Oper. Res. 31(5): 791-801 (2004)
Coauthor Index
[j73] [j71] [j70] [j64] [j63] [j62] [j60] [j59] [j58] [j57] [j56] [j54] [j53] [j52] [j48] [j47] [j46] [j45] [j43] [j42] [j41] [j40] [j39] [j38] [j35] [j34] [j33] [j31] [j30] [j29] [j28] [j27] [j26] [j25] [j24] [j23] [j22] [j21] [j20] [j19] [j17] [j16] [j15] [j14] [j12] [j11] [j10] [j7] [j4] [j3] [p1] [j2] [c2] [c1]
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-03 20:11 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:
