Chin-Chia Wu
Orcid: 0000-0002-1598-5127
According to our database1,
Chin-Chia Wu
authored at least 116 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method.
Oper. Res., March, 2024
Int. J. Prod. Res., January, 2024
PeerJ Comput. Sci., 2024
2023
Appl. Soft Comput., November, 2023
Sequencing single machine multiple-class customer order jobs using heuristics and improved simulated annealing algorithms.
RAIRO Oper. Res., May, 2023
Wasserstein distributionally robust chance-constrained program with moment information.
Comput. Oper. Res., April, 2023
2022
J. Comb. Optim., 2022
Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans.
Int. J. Prod. Res., 2022
A bicriterion single-machine scheduling problem with step-improving processing times.
Comput. Ind. Eng., 2022
2021
Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times.
Swarm Evol. Comput., 2021
Robust scheduling for a two-stage assembly shop with scenario-dependent processing times.
Int. J. Prod. Res., 2021
2020
Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect.
Soft Comput., 2020
A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect.
Soft Comput., 2020
Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates.
Expert Syst. Appl., 2020
Parallel-machine scheduling with linear deteriorating jobs and preventive maintenance activities under a potential machine disruption.
Comput. Ind. Eng., 2020
A Hybrid Discrete Differential Evolution Algorithm to Solve the Split Delivery Vehicle Routing Problem.
IEEE Access, 2020
2019
Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times.
Swarm Evol. Comput., 2019
Dominance rule and opposition-based particle swarm optimization for two-stage assembly scheduling with time cumulated learning effect.
Soft Comput., 2019
Soft Comput., 2019
Tardiness minimisation for a customer order scheduling problem with sum-of-processing-time-based learning effect.
J. Oper. Res. Soc., 2019
Int. J. Prod. Res., 2019
A two-stage three-machine assembly scheduling flowshop problem with both two-agent and learning phenomenon.
Comput. Ind. Eng., 2019
2018
A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization.
Swarm Evol. Comput., 2018
Single-machine batch scheduling problem with job rejection and resource dependent processing times.
RAIRO Oper. Res., 2018
Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times.
Oper. Res., 2018
Machine scheduling problems under deteriorating effects and deteriorating rate-modifying activities.
J. Oper. Res. Soc., 2018
Single-machine scheduling and common due date assignment with potential machine disruption.
Int. J. Prod. Res., 2018
A two-stage three-machine assembly scheduling problem with a position-based learning effect.
Int. J. Prod. Res., 2018
A Multi-Machine Order Scheduling with Learning Using the Genetic Algorithm and Particle Swarm Optimization.
Comput. J., 2018
Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem.
Comput. Ind. Eng., 2018
A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion.
Asia Pac. J. Oper. Res., 2018
2017
A two-agent single-machine scheduling problem to minimize the total cost with release dates.
Soft Comput., 2017
Soft Comput., 2017
Soft Comput., 2017
J. Sched., 2017
A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect.
J. Oper. Res. Soc., 2017
An Investigation of Single-Machine Due-Window Assignment with Time-Dependent Processing Times and a Controllable Rate-Modifying Activity.
Comput. J., 2017
Resource constrained scheduling problems with general truncated sum-of-processing time dependent effect under single machine and unrelated parallel machines.
Comput. Ind. Eng., 2017
An iterated local search for the multi-objective permutation flowshop scheduling problem with sequence-dependent setup times.
Appl. Soft Comput., 2017
Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times.
Appl. Soft Comput., 2017
2016
Improved Algorithms for Single-Machine Serial-Batch Scheduling With Rejection to Minimize Total Completion Time and Total Rejection Cost.
IEEE Trans. Syst. Man Cybern. Syst., 2016
Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem.
Soft Comput., 2016
Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times.
J. Oper. Res. Soc., 2016
Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration.
Int. J. Comput. Intell. Syst., 2016
Comput. Oper. Res., 2016
Comput. Ind. Eng., 2016
A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing.
Asia Pac. J. Oper. Res., 2016
2015
Single-machine scheduling with time-dependent and position-dependent deteriorating jobs.
Int. J. Comput. Integr. Manuf., 2015
Comput. Ind. Eng., 2015
2014
Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time.
J. Oper. Res. Soc., 2014
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects.
Inf. Sci., 2014
Inf. Sci., 2014
A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan.
Appl. Soft Comput., 2014
Asia Pac. J. Oper. Res., 2014
Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration.
Asia Pac. J. Oper. Res., 2014
Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs.
Appl. Math. Comput., 2014
Proceedings of the 2014 IEEE International Conference on Automation Science and Engineering, 2014
Proceedings of the 2014 IEEE International Conference on Automation Science and Engineering, 2014
Proceedings of the 2nd International Conference on 3D Vision, 2014
2013
Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions.
J. Oper. Res. Soc., 2013
Inf. Sci., 2013
Inf. Sci., 2013
Single-machine common due window assignment and scheduling to minimize the total cost.
Discret. Optim., 2013
Comput. Oper. Res., 2013
Single-machine batch delivery scheduling with an assignable common due date and controllable processing times.
Comput. Ind. Eng., 2013
A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents.
Appl. Soft Comput., 2013
Appl. Soft Comput., 2013
The single-machine total tardiness problem with unequal release times and a linear deterioration.
Appl. Math. Comput., 2013
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2013
2012
Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations.
J. Intell. Manuf., 2012
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties.
Inf. Sci., 2012
A generalisation model of learning and deteriorating effects on a single-machine scheduling with past-sequence-dependent setup times.
Int. J. Comput. Integr. Manuf., 2012
The single-machine total weighted tardiness scheduling problem with position-based learning effects.
Comput. Oper. Res., 2012
An investigation on a two-agent single-machine scheduling problem with unequal release dates.
Comput. Oper. Res., 2012
Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost.
Comput. Ind. Eng., 2012
Appl. Math. Comput., 2012
2011
J. Oper. Res. Soc., 2011
An Efficient 3D Model Retrieval Based on Principal Axes Analysis and Feature Integration.
Int. J. Pattern Recognit. Artif. Intell., 2011
Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times.
Comput. Oper. Res., 2011
Some single-machine and flowshop scheduling problems with a non-linear deterioration function.
Comput. Math. Appl., 2011
Comput. Ind. Eng., 2011
Two-machine flowshop scheduling with truncated learning to minimize the total completion time.
Comput. Ind. Eng., 2011
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations.
Comput. Ind. Eng., 2011
Asia Pac. J. Oper. Res., 2011
Appl. Math. Comput., 2011
2010
Erratum to 'Some single-machine and m-machine flowshop scheduling problems with learning considerations' [Inform. Sci. 179(2009) 3885-3892].
Inf. Sci., 2010
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem.
Expert Syst. Appl., 2010
Comput. Ind. Eng., 2010
A note on optimal policies for two group scheduling problems with deteriorating setup and processing times.
Comput. Ind. Eng., 2010
Erratum to 'Single-machine and flowshop scheduling with a general learning effect model' [Computers & Industrial Engineering 56 (2009) 1553-1558].
Comput. Ind. Eng., 2010
Scheduling problems with deteriorating jobs and learning effects including proportional setup times.
Comput. Ind. Eng., 2010
2009
Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs.
J. Oper. Res. Soc., 2009
Some single-machine and m-machine flowshop scheduling problems with learning considerations.
Inf. Sci., 2009
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations.
Inf. Sci., 2009
Expert Syst. Appl., 2009
A note on the total completion time problem in a permutation flowshop with a learning effect.
Eur. J. Oper. Res., 2009
Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates.
Comput. Oper. Res., 2009
Comput. Ind. Eng., 2009
Comput. Ind. Eng., 2009
2008
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects.
Inf. Sci., 2008
Comput. Oper. Res., 2008
Comput. Ind. Eng., 2008
Comput. Ind. Eng., 2008
Comput. Ind. Eng., 2008
2007
Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations.
Comput. Ind. Eng., 2007
2006
J. Oper. Res. Soc., 2006
2004
Acta Informatica, 2004
2003
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine.
Inf. Process. Lett., 2003
2001
Int. J. Syst. Sci., 2001
2000
Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness.
Int. J. Syst. Sci., 2000
1996
An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop.
Int. J. Syst. Sci., 1996