%0 Conference Paper
%A Kanesan , Muthusamy
%A Ishii, Hiroaki
%A Mohri, Shintaro
%A Masuda, Teruo 
%A Open University Malaysia,
%B Scheduling Symposium 2000
%C Hamamatsu, Japan
%D 2000
%F library_repository:622
%K Beam search, Flow-shop, Gap concept, Multiobjective, Non-dominated solutions
%T Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
%U https://library.oum.edu.my/repository/622/
%X 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)