Osaka Prefecture University Repository >
A.Osaka Prefecuture University:(2005-) >
0400.School of Economics/Graduate School of Economics >
Journal of economics, business and law >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10466/994

Title: <ARTICLE>A Genetic Algorithm for Bicriteria Scheduling Problems
Authors: Morita, Hiroyuki
Issue Date: 31-Mar-2000
Publisher: College of Economics, Osaka Prefecture University
Citation: Journal of economics, business and law. 2000, 2, p.117-133
Abstract: In this paper, a genetic algorithm that produces an approximate set of all non-dominated solutions is proposed for a bicriteria permutation scheduling problem. And a measure of distance between the set of all non-dominated solutions and any approximate set is defined. In order to show its effectiveness, we shall compare its performance with exact non-dominated solutions by carrying out computational experiments for a bicriteria single machine permutation scheduling problem. Computational results demonstrate that proposed algorithm have good performance from viewpoints of both solution quality and computational efficiency for practical input size case.
URI: http://hdl.handle.net/10466/994
Appears in Collections:VOLUME 2

Files in This Item:

File Description SizeFormat
KJ00000046021.pdf949.56 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.