Browsing by Author "Chou, FD"

Now showing 1 - 2 of 2

A two-machine flowshop scheduling heuristic with bicriteria objective
(1998-06-01)
Lee, CE
;
Chou, FD
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
This paper presents a O(N-2) heuristic algorithm to solve the two-machine flowshop scheduling with bicriteria objective to minimize the sum of makespan and total flow time. An integer programming model with N-2+2N variables and 3N constraints is also formulated to validate the performance of the heuristic scheduling algorithm proposed here. Experimental results demonstrate that the proposed algorithm can efficiently solve this problem with a high solution quality. Although the integer programming model provides the optimal solution, variables and constraints markedly increase when the number of jobs increases. Therefore, the optimal solution is not always attainable within the allowable time. The heuristic algorithm is much more practical in real world applications than the integer programming model.
Two-machine flowshop scheduling with bicriteria problem
(1999-07-01)
Chou, FD
;
Lee, CE
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
This paper attempts to solve a two-machine flowshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total flow time and makespan. To tackle this scheduling problem, an integer programming model with N-2 + 3N variables and 5N is the number of jobs, is formulated. Because of the lengthy computing time and high computing complexity of the integer programming model, a heuristic scheduling algorithm is presented. Experimental results show that the proposed heuristic algorithm can solve this problem rapidly and accurately. The average solution quality of the heuristic algorithm is above 99% and is much better than that of the SPT rule as a benchmark. A 15-job case requires only 0.018 s, on average to obtain an ultimate or even optimal solution. The heuristic scheduling algorithm is a more practical approach to real world applications than the integer programming model. (C) 1999 Published by Elsevier Science Ltd. All rights reserved.