Kuo-Ching Ying

Orcid: 0000-0002-9549-5290

According to our database1, Kuo-Ching Ying authored at least 80 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Correction: N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling.
Ann. Oper. Res., January, 2024

2023
Tailored Iterated Greedy metaheuristic for a scheduling problem in metal 3D printing.
Adv. Eng. Softw., December, 2023

Minimizing makespan in two-stage assembly additive manufacturing: A reinforcement learning iterated greedy algorithm.
Appl. Soft Comput., May, 2023

Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups.
Ann. Oper. Res., March, 2023

Reinforcement learning iterated greedy algorithm for distributed assembly permutation flowshop scheduling problems.
J. Ambient Intell. Humaniz. Comput., 2023

Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times.
Int. J. Prod. Res., 2023

2022
Adjusted Iterated Greedy for the optimization of additive manufacturing scheduling problems.
Expert Syst. Appl., 2022

Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic.
Comput. Ind. Eng., 2022

2021
Minimising makespan in job-shops with deterministic machine availability constraints.
Int. J. Prod. Res., 2021

New benchmark algorithm for hybrid flowshop scheduling with identical machines.
Expert Syst. Appl., 2021

Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems.
Expert Syst. Appl., 2021

Deep learning-based optimization for motion planning of dual-arm assembly robots.
Comput. Ind. Eng., 2021

New benchmark algorithms for No-wait Flowshop Group Scheduling Problem with Sequence-Dependent Setup Times.
Appl. Soft Comput., 2021

Unsupervised Learning-based Artificial Bee Colony for minimizing non-value-adding operations.
Appl. Soft Comput., 2021

New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times.
Appl. Soft Comput., 2021

2020
Solving no-wait job-shop scheduling problems using a multi-start simulated annealing with bi-directional shift timetabling algorithm.
Comput. Ind. Eng., 2020

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times.
IEEE Access, 2020

Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times.
IEEE Access, 2020

Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops.
IEEE Access, 2020

Greedy-Based Non-Dominated Sorting Genetic Algorithm III for Optimizing Single-Machine Scheduling Problem With Interfering Jobs.
IEEE Access, 2020

2019
Intelligent parametric design for a multiple-quality-characteristic glue-dispensing process.
J. Intell. Manuf., 2019

Minimising makespan in distributed mixed no-idle flowshops.
Int. J. Prod. Res., 2019

Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times.
Comput. Ind. Eng., 2019

Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times.
Comput. Ind. Eng., 2019

Solving the Mask Data Preparation Scheduling Problem Using Meta-Heuristics.
IEEE Access, 2019

Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems.
IEEE Access, 2019

Single Machine Job Sequencing With a Restricted Common Due Window.
IEEE Access, 2019

Scheduling Jobs of Two Competing Agents on a Single Machine.
IEEE Access, 2019

2018
Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks.
Expert Syst. Appl., 2018

Minimizing makespan for no-wait flowshop scheduling problems with setup times.
Comput. Ind. Eng., 2018

Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities.
Comput. Ind. Eng., 2018

Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints.
IEEE Access, 2018

Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach.
IEEE Access, 2018

Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop.
IEEE Access, 2018

Decreasing the System Testing Makespan in a Computer Manufacturing Company.
IEEE Access, 2018

2017
Minimising total cost for training and assigning multiskilled workers in seru production systems.
Int. J. Prod. Res., 2017

Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window.
Int. J. Prod. Res., 2017

Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems.
Comput. Ind. Eng., 2017

Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms.
IEEE Access, 2017

Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan.
IEEE Access, 2017

2016
Self-adaptive ruin-and-recreate algorithm for minimizing total flow time in no-wait flowshops.
Comput. Ind. Eng., 2016

Exact algorithms for single-machine scheduling problems with a variable maintenance.
Comput. Ind. Eng., 2016

Minimizing makespan for solving the distributed no-wait flowshop scheduling problem.
Comput. Ind. Eng., 2016

2015
Scheduling the two-machine flowshop to hedge against processing time uncertainty.
J. Oper. Res. Soc., 2015

Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness.
Appl. Soft Comput., 2015

2014
Efficient wafer sorting scheduling using a hybrid artificial immune system.
J. Oper. Res. Soc., 2014

Minimizing shifts for personnel task scheduling problems: A three-phase algorithm.
Eur. J. Oper. Res., 2014

ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times.
Comput. Oper. Res., 2014

Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times.
Comput. Ind. Eng., 2014

Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times.
Appl. Soft Comput., 2014

2013
Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm.
J. Oper. Res. Soc., 2013

Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning.
Comput. Oper. Res., 2013

Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm.
Comput. Oper. Res., 2013

2012
Makespan minimization for scheduling unrelated parallel machines with setup times.
J. Intell. Manuf., 2012

Robust scheduling on a single machine to minimize total flow time.
Comput. Oper. Res., 2012

An intelligent algorithm with feature selection and decision rules applied to anomaly intrusion detection.
Appl. Soft Comput., 2012

2011
Meta-heuristic algorithms for wafer sorting scheduling problems.
J. Oper. Res. Soc., 2011

Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times.
Expert Syst. Appl., 2011

Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates.
Comput. Oper. Res., 2011

A novel function approximation based on robust fuzzy regression algorithm model and particle swarm optimization.
Appl. Soft Comput., 2011

2010
An ensemble approach applied to classify spam e-mails.
Expert Syst. Appl., 2010

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., 2010

Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic.
Expert Syst. Appl., 2010

An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem.
Appl. Intell., 2010

2009
An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks.
J. Oper. Res. Soc., 2009

Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic.
Expert Syst. Appl., 2009

Raising the hit rate for wafer fabrication by a simple constructive heuristic.
Expert Syst. Appl., 2009

Applying hybrid meta-heuristics for capacitated vehicle routing problem.
Expert Syst. Appl., 2009

Testing the significance of solar term effect in the Taiwan stock market.
Expert Syst. Appl., 2009

The causality of hourly price-volume relationship: An empirical study of mini Taiwan exchange futures.
Expert Syst. Appl., 2009

Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times.
Comput. Oper. Res., 2009

2008
A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date.
Proceedings of the Metaheuristics for Scheduling in Industrial and Manufacturing Applications, 2008

A hybrid approach for single-machine tardiness problems with sequence-dependent setup times.
J. Oper. Res. Soc., 2008

Particle swarm optimization for parameter determination and feature selection of support vector machines.
Expert Syst. Appl., 2008

Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm.
Comput. Ind. Eng., 2008

2007
A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date.
Eur. J. Oper. Res., 2007

An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2007

2006
Applying Simulated Annealing Approach for Capacitated Vehicle Routing Problems.
Proceedings of the IEEE International Conference on Systems, 2006

Vehicle Routing Problems with Time Windows Using Simulated Annealing.
Proceedings of the IEEE International Conference on Systems, 2006

2004
An ant colony system for permutation flow-shop sequencing.
Comput. Oper. Res., 2004


  Loading...