Cover Image

Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Kanesan , Muthusamy, Ishii, Hiroaki, Mohri, Shintaro, Masuda, Teruo
Format: Conference or Workshop Item
Published: 2000
Subjects:
TS Manufactures
Online Access:http://library.oum.edu.my/repository/622/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.oum.622
record_format eprints
spelling my.oum.6222011-11-03T06:08:58Z Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem Kanesan , Muthusamy Ishii, Hiroaki Mohri, Shintaro Masuda, Teruo TS Manufactures 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) 2000 Conference or Workshop Item PeerReviewed Kanesan , Muthusamy and Ishii, Hiroaki and Mohri, Shintaro and Masuda, Teruo (2000) Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem. In: Scheduling Symposium 2000, Hamamatsu, Japan. http://library.oum.edu.my/repository/622/
institution Open University Malaysia
building OUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Open University Malaysia
content_source OUM Knowledge Repository
url_provider http://library.oum.edu.my/repository/
topic TS Manufactures
spellingShingle TS Manufactures
Kanesan , Muthusamy
Ishii, Hiroaki
Mohri, Shintaro
Masuda, Teruo
Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
description 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)
format Conference or Workshop Item
author Kanesan , Muthusamy
Ishii, Hiroaki
Mohri, Shintaro
Masuda, Teruo
author_facet Kanesan , Muthusamy
Ishii, Hiroaki
Mohri, Shintaro
Masuda, Teruo
author_sort Kanesan , Muthusamy
title Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
title_short Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
title_full Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
title_fullStr Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
title_full_unstemmed Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
title_sort beam search approach for the multiobjective flow-shop scheduling problem
publishDate 2000
url http://library.oum.edu.my/repository/622/
_version_ 1644309026537734144
score 13.159267

Similar Items