Skip to main content

7 Result(s)

within Ching-Jong Liao Remove this filter

and

  1. No Access

    Article

    A Hybrid Tabu Search Algorithm for the Variable Periodic Vehicle Routing Problem

    This paper presents a real-life variable periodic vehicle routing problem (VPVRP) which is originated from an auto parts company. The idea of lean production has been applied in the production of the auto part...

    Ching-Jong Liao, Cheng-Hsiung Lee… in Arabian Journal for Science and Engineering (2017)

  2. No Access

    Chapter and Conference Paper

    Scheduling a Hybrid Flow-Shop Problem via Artificial Immune System

    This paper investigates a two-stage hybrid flowshop problem with a single batch processing machine in the first stage and a single machine in the second stage. In the problem, each job has an individual releas...

    Tsui-** Chung, Ching-Jong Liao in Proceedings of the Institute of Industrial… (2013)

  3. No Access

    Article

    Makespan minimization for two parallel machines with an unavailable period on each machine

    In this paper, we consider a two parallel machine problem where each machine has a fixed and known unavailable period. The objective is to minimize the makespan. In the literature, the problem has been conside...

    Chien-Hung Lin, Ching-Jong Liao in The International Journal of Advanced Manu… (2007)

  4. No Access

    Article

    Minimizing the Range of Order Completion Times with Multiple Job Classes

    A number of important contributions have been made toward the problem of minimizing the difference in ‘customer’ treatment on a single machine. However, so far, all the research has been to solve the problem o...

    Ching-Jong Liao, Li-Man Liao in Journal of the Operational Research Society (1993)

  5. No Access

    Article

    Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop

    This paper considers a selected sequence in a permutation flow-shop. The objective is to minimize the number of machine idle intervals with minimum makespan (or total production time) for this selected sequenc...

    Ching-Jong Liao in Journal of the Operational Research Society (1993)

  6. No Access

    Article

    An Improved Formulation for the Job-Shop Scheduling Problem

    This paper presents an extension of an earlier integer programming model developed by other authors to formulate a general n-job, m-machine job-shop problem. The new formulation involves substantially fewer funct...

    Ching-Jong Liao, Chii-Tsuen You in Journal of the Operational Research Society (1992)

  7. No Access

    Article

    An Algorithm for Minimizing the Range of Lateness on a Single Machine

    This paper considers the problem of minimizing the range of lateness on a single machine. All the algorithms in the literature for solving this problem are based on the branch-and-bound approach, which has an ...

    Ching-Jong Liao, Rong-Hwa Huang in Journal of the Operational Research Society (1991)