Liao Ching-Jong

Ching-Jong Liao

Information about the author Ching-Jong Liao will soon be added to the site.
Found 27 papers in total
An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan
An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan
2015
This paper considers a two‐stage assembly scheduling problem of N products with...
Approaches to eliminate waste and reduce cost for recycling glass
Approaches to eliminate waste and reduce cost for recycling glass
2011
In recent years, the issue of environmental protection has received considerable...
A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
2008
The multistage hybrid flow-shop scheduling problem with multiprocessor tasks has been...
An ant colony optimisation algorithm for scheduling in agile manufacturing
An ant colony optimisation algorithm for scheduling in agile manufacturing
2008
Producing customised products in a short time at low cost is one of the goals of agile...
A note on two-stage hybrid flowshop scheduling with missing operations
A note on two-stage hybrid flowshop scheduling with missing operations
2008
The scheduling problem in a multi-stage hybrid flow shop has been the subject of...
Makespan minimization for multiple uniform machines
Makespan minimization for multiple uniform machines
2008
We consider a classical scheduling problem with makespan minimization on uniform...
Ant colony optimization combined with taboo search for the job shop scheduling problem
Ant colony optimization combined with taboo search for the job shop scheduling problem
2008
In this paper, we present a hybrid algorithm combining ant colony optimization...
Minimizing makespan on parallel machines with machine eligibility restrictions
Minimizing makespan on parallel machines with machine eligibility restrictions
2008
In this paper, we consider a parallel machine problem where machines and jobs can be...
A discrete version of particle swarm optimization for flowshop scheduling problems
A discrete version of particle swarm optimization for flowshop scheduling problems
2007
Particle swarm optimization (PSO) is a novel metaheuristic inspired by the flocking...
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date
2007
Although the concept of just-in-time (JIT) production systems has been proposed for...
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
2007
In many real-world production systems, it requires an explicit consideration of...
A tabu search approach for single machine scheduling with major and minor setups
A tabu search approach for single machine scheduling with major and minor setups
2002
In this paper, we consider a single machine scheduling problem where jobs are grouped...
Makespan minimization for two parallel machines with an availability constraint
Makespan minimization for two parallel machines with an availability constraint
2005
In this paper, we consider a two parallel machine problem where one machine is not...
Makespan minimization subject to flowtime optimality on identical parallel machines
Makespan minimization subject to flowtime optimality on identical parallel machines
2004
We consider the identical parallel machine problem with makespan minimization subject...
An ant colony system for permutation flow-shop sequencing
An ant colony system for permutation flow-shop sequencing
2004
Ant colony system (ACS) is a novel meta-heuristic inspired by the foraging behavior of...
Makespan minimization for two uniform parallel machines
Makespan minimization for two uniform parallel machines
2003
We consider the two uniform parallel machine problem with the objective of minimizing...
Batching to minimize total production time for two part types
Batching to minimize total production time for two part types
1997
Consider the jobs at a bottleneck facility for two subsequent production lines, each...
Single facility scheduling with major and minor setups
Single facility scheduling with major and minor setups
1997
This article considers the problem of scheduling a given set of jobs at a single...
Group scheduling on two cells with intercell movement
Group scheduling on two cells with intercell movement
1996
A set of jobs needs to be processed in a GT/CM system, which consists of two cells...
Sequencing with setup time and order tardiness trade-offs
Sequencing with setup time and order tardiness trade-offs
1996
The authors consider the problem of scheduling customer orders on a single facility...
An inventory system with multiple replenishment scheduling
An inventory system with multiple replenishment scheduling
1994
The authors consider an inventory system in which more than one replenishment of an...
Flow-shop scheduling with flexible processors
Flow-shop scheduling with flexible processors
1995
The authors consider a permutation flow-shop where one or more processors is flexible....
A new node selection strategy in the branch-and-bound procedure
A new node selection strategy in the branch-and-bound procedure
1994
This paper proposes a new node selection strategy, known as the locally best bound...
Tradeoff between setup times and carrying costs for finished items
Tradeoff between setup times and carrying costs for finished items
1993
This paper considers a multiple job class problem with bi-criteria. One criterion is...
Papers per page: