Kuo-Ching Ying mainly investigates Mathematical optimization, Simulated annealing, Job shop scheduling, Iterated greedy and Greedy algorithm. In general Mathematical optimization, his work in Scheduling and Heuristic is often linked to Sequence-dependent setup linking many areas of study. His Simulated annealing research includes elements of Genetic algorithm, Tabu search and Metaheuristic.
Kuo-Ching Ying is interested in Flow shop scheduling, which is a field of Job shop scheduling. As a member of one scientific family, he mostly works in the field of Algorithm, focusing on Anomaly-based intrusion detection system and, on occasion, Support vector machine and Feature selection. His study looks at the relationship between Search algorithm and topics such as Artificial intelligence, which overlap with Particle swarm optimization.
Kuo-Ching Ying mostly deals with Mathematical optimization, Job shop scheduling, Simulated annealing, Scheduling and Metaheuristic. His Mathematical optimization research integrates issues from Algorithm and Benchmark. His work on Flow shop scheduling as part of general Job shop scheduling study is frequently linked to Problem set, Heuristics, Manufacturing cell and Ant colony, therefore connecting diverse disciplines of science.
His studies in Simulated annealing integrate themes in fields like Genetic algorithm and Tabu search. Distributed manufacturing is closely connected to Industrial engineering in his research, which is encompassed under the umbrella topic of Scheduling. His biological study spans a wide range of topics, including Machine learning and Pattern recognition.
His primary areas of investigation include Job shop scheduling, Mathematical optimization, Metaheuristic, Scheduling and Simulated annealing. Kuo-Ching Ying integrates many fields, such as Job shop scheduling, Benchmark and Approximation algorithm, in his works. His study in the field of Genetic algorithm and Integer programming is also linked to topics like Machine scheduling.
His Metaheuristic research integrates issues from Robot and Local search. His Scheduling study combines topics from a wide range of disciplines, such as Analytics and Industrial engineering. The various areas that Kuo-Ching Ying examines in his Simulated annealing study include Advanced manufacturing and Meta heuristic.
Kuo-Ching Ying mainly focuses on Job shop scheduling, Mathematical optimization, Metaheuristic, Scheduling and Simulation. Among his research on Job shop scheduling, you can see a combination of other fields of science like Manufacturing cell and Optimization problem. Mathematical optimization is often connected to Benchmark in his work.
His Metaheuristic research incorporates elements of Genetic algorithm and Local search. His Scheduling study incorporates themes from Industrial engineering, Simulated annealing, Distributed manufacturing and Advanced manufacturing. As part of his studies on Simulation, Kuo-Ching Ying often connects relevant subjects like Beam search.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Particle swarm optimization for parameter determination and feature selection of support vector machines
Shih-Wei Lin;Kuo-Ching Ying;Shih-Chieh Chen;Zne-Jung Lee.
Expert Systems With Applications (2008)
An ant colony system for permutation flow-shop sequencing
Kuo-Ching Ying;Ching-Jong Liao.
Computers & Operations Research (2004)
An intelligent algorithm with feature selection and decision rules applied to anomaly intrusion detection
Shih-Wei Lin;Kuo-Ching Ying;Chou-Yuan Lee;Zne-Jung Lee.
soft computing (2012)
Applying hybrid meta-heuristics for capacitated vehicle routing problem
Shih-Wei Lin;Zne-Jung Lee;Kuo-Ching Ying;Chou-Yuan Lee.
Expert Systems With Applications (2009)
Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
Kuo-Ching Ying;Shih-Wei Lin.
International Journal of Production Research (2006)
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Shih-Wei Lin;Kuo-Ching Ying;Chien-Yi Huang.
International Journal of Production Research (2013)
Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic
Kuo-Ching Ying;Hui-Miao Cheng.
Expert Systems With Applications (2010)
An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem
Chou-Yuan Lee;Zne-Jung Lee;Shih-Wei Lin;Kuo-Ching Ying.
Applied Intelligence (2010)
Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic
The International Journal of Advanced Manufacturing Technology (2008)
Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics
Shih-Wei Lin;Kuo-Ching Ying.
The International Journal of Advanced Manufacturing Technology (2007)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: