Ching-Jong Liao

Orcid: 0000-0002-3297-8930

According to our database1, Ching-Jong Liao authored at least 39 papers between 1992 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint.
Comput. Ind. Eng., 2017

2016
Multi-attribute approach to sustainable supply chain management under uncertainty.
Ind. Manag. Data Syst., 2016

2015
An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan.
Comput. Ind. Eng., 2015

2014
Unrelated parallel machine scheduling with dedicated machines and common deadline.
Comput. Ind. Eng., 2014

A comparison of five hybrid metaheuristic algorithms for unrelated parallel-machine scheduling and inbound trucks sequencing in multi-door cross docking systems.
Appl. Soft Comput., 2014

2013
An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem.
Appl. Soft Comput., 2013

2012
Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups.
Theor. Comput. Sci., 2012

An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times.
Comput. Math. Appl., 2012

Scheduling with multi-attribute setup times.
Comput. Ind. Eng., 2012

An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem.
Appl. Soft Comput., 2012

A discrete electromagnetism-like mechanism for single machine total weighted tardiness problem with sequence-dependent setup times.
Appl. Soft Comput., 2012

2011
An ant colony optimization algorithm for setup coordination in a two-stage production system.
Appl. Soft Comput., 2011

2010
Vehicle routing with cross-docking in the supply chain.
Expert Syst. Appl., 2010

2009
Minimizing the sum of job completion times on capacitated two-parallel machines.
Eur. J. Oper. Res., 2009

Minimizing total tardiness on a single machine with controllable processing times.
Comput. Oper. Res., 2009

2008
Improved MILP models for two-machine flowshop with batch processing machines.
Math. Comput. Model., 2008

A discrete particle swarm optimization for lot-streaming flowshop scheduling problem.
Eur. J. Oper. Res., 2008

Ant colony optimization combined with taboo search for the job shop scheduling problem.
Comput. Oper. Res., 2008

A note on two-stage hybrid flowshop scheduling with missing operations.
Comput. Ind. Eng., 2008

Makespan minimization for multiple uniform machines.
Comput. Ind. Eng., 2008

2007
Minimizing makespan for two parallel machines with job limit on each availability interval.
J. Oper. Res. Soc., 2007

A discrete version of particle swarm optimization for flowshop scheduling problems.
Comput. Oper. Res., 2007

An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups.
Comput. Oper. Res., 2007

A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date.
Comput. Ind. Eng., 2007

2005
Makespan minimization for two parallel machines with an availability constraint.
Eur. J. Oper. Res., 2005

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

Makespan minimization subject to flowtime optimality on identical parallel machines.
Comput. Oper. Res., 2004

Scheduling under machine breakdown in a continuous process industry.
Comput. Oper. Res., 2004

2003
Single-machine scheduling with periodic maintenance and nonresumable jobs.
Comput. Oper. Res., 2003

1998
Batching and sequencing of jobs with order availability at a single facility.
Int. J. Syst. Sci., 1998

1997
Single facility scheduling with major and minor setups.
Comput. Oper. Res., 1997

1996
Optimal scheduling of products with common and unique components.
Int. J. Syst. Sci., 1996

Group scheduling on two cells with intercell movement.
Comput. Oper. Res., 1996

1995
Flow-shop scheduling with flexible processors.
Comput. Oper. Res., 1995

1994
An inventory system with multiple replenishment scheduling.
Oper. Res. Lett., 1994

A new node selection strategy in the branch-and-bound procedure.
Comput. Oper. Res., 1994

1993
Tradeoff between setup times and carrying costs for finished items.
Comput. Oper. Res., 1993

1992
A heuristic for determining the optimal order in a tandem queue.
Comput. Oper. Res., 1992

Use of variable range in solving multiple criteria scheduling problems.
Comput. Oper. Res., 1992


  Loading...