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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
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
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
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
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
2009
Eur. J. Oper. Res., 2009
Comput. Oper. Res., 2009
2008
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
Comput. Ind. Eng., 2008
2007
Minimizing makespan for two parallel machines with job limit on each availability interval.
J. Oper. Res. Soc., 2007
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
Eur. J. Oper. Res., 2005
2004
Comput. Oper. Res., 2004
Comput. Oper. Res., 2004
2003
Comput. Oper. Res., 2003
1998
Int. J. Syst. Sci., 1998
1997
1996
Int. J. Syst. Sci., 1996
1995
1994
Comput. Oper. Res., 1994
1993
Comput. Oper. Res., 1993
1992
Comput. Oper. Res., 1992
Comput. Oper. Res., 1992