TY  - CONF
ID  - library_repository622
UR  - https://library.oum.edu.my/repository/622/
A1  - Kanesan , Muthusamy
A1  - Ishii, Hiroaki
A1  - Mohri, Shintaro
A1  - Masuda, Teruo 
Y1  - 2000///
N2  - In this paper, we address the problem of minimizing maximum completion time and average flow-time simultaneously in a flow-shop environment. We formulate the problem as a bi-criteria flow-shop scheduling problem in which it minimizes the maximum completion time and average flow-time. We develop and propose an approximation algorithm to find the non-dominated solutions for the above problem. As a solution technique, we propose a new approach based on the beam search with gap concept. (Abstract by authors)
KW  - Beam search
KW  -  Flow-shop
KW  -  Gap concept
KW  -  Multiobjective
KW  -  Non-dominated solutions
TI  - Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
AV  - none
M2  - Hamamatsu, Japan
T2  - Scheduling Symposium 2000
ER  -