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: | 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!
|
Similar Items
-
Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
by: Kanesan , Muthusamy, et al.
Published: (2001) -
Scheduling Problem with Fuzzy Due-dates on Unrelated Parallel Processors
by: Kanesan , Muthusamy, et al.
Published: (2000) -
Scheduling problems with generalized precedence relations
by: Kanesan , Muthusamy, et al.
Published: (1999) -
Scheduling with fuzzy delays and fuzzy precedences
by: Kanesan , Muthusamy, et al.
Published: (2003) -
Tabu search method for solving multiobjective job shop scheduling problem
by: Awang, Nor Fauzana
Published: (2015)