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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2000
|
| Subjects: | |
| Online Access: | https://library.oum.edu.my/repository/622/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1831338926321696768 |
|---|---|
| author | Kanesan , Muthusamy Ishii, Hiroaki Mohri, Shintaro Masuda, Teruo |
| author_facet | Kanesan , Muthusamy Ishii, Hiroaki Mohri, Shintaro Masuda, Teruo |
| author_sort | Kanesan , Muthusamy |
| building | OUM Library |
| collection | Institutional Repository |
| content_provider | Open University Malaysia |
| content_source | OUM Knowledge Repository |
| continent | Asia |
| country | Malaysia |
| 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 |
| id | my.oum.622 |
| institution | Open University Malaysia |
| publishDate | 2000 |
| 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. https://library.oum.edu.my/repository/622/ |
| spellingShingle | TS Manufactures Kanesan , Muthusamy Ishii, Hiroaki Mohri, Shintaro Masuda, Teruo Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem |
| title | 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_short | Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem |
| title_sort | beam search approach for the multiobjective flow-shop scheduling problem |
| topic | TS Manufactures |
| url | https://library.oum.edu.my/repository/622/ |
| url_provider | http://library.oum.edu.my/repository/ |