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:
Online Access:http://library.oum.edu.my/repository/622/
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first