Title of article
Generating efficient points of bicriteria scheduling problem by using compromise programming
Author/Authors
Taboun S. M.، نويسنده , , Abib A. H.، نويسنده , , Atmani A.، نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1995
Pages
5
From page
227
To page
231
Abstract
In this paper, we examine a bicriteria scheduling problem with objective of minimizing total tardiness and earliness vs mean flow time and also minimizing total tardiness vs total earliness. Since they have conflicting results we will use compromise programming in order to generate the efficient point
Journal title
Computers & Industrial Engineering
Serial Year
1995
Journal title
Computers & Industrial Engineering
Record number
924345
Link To Document