@article{oai:omu.repo.nii.ac.jp:00000926,
 author = {Morita, Hiroyuki},
 journal = {Journal of economics, business and law},
 month = {Mar},
 note = {application/pdf, 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., Journal of economics, business and law. 2000, 2, p.117-133},
 pages = {117--133},
 title = {<ARTICLE>A Genetic Algorithm for Bicriteria Scheduling Problems},
 volume = {2},
 year = {2000}
}