Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences
Data(s) |
01/07/2009
|
---|---|
Resumo |
In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). The objective is to find a sequence that performs well with respect to both the objectives: the total completion time and the total absolute differences in completion times. In an earlier study, a method of solving bi-criteria transportation problem is presented. In this paper, we use the methodology of solvin bi-criteria transportation problem, to our bi-criteria single machine scheduling problem with a learning effect, and obtain the set of optimal sequences,. Numerical examples are presented for illustrating the applicability and ease of understanding. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/21344/1/m.pdf Mani, V and Chang, Pei Chann and Chen, Shih Hsin (2009) Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences. In: Computers & Mathematics with Applications, 58 (1). pp. 39-47. |
Publicador |
Elsevier Science |
Relação |
http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYJ-4W8TJH9-2-3&_cdi=5620&_user=512776&_orig=browse&_coverDate=07%2F31%2F2009&_sk=999419998&view=c&wchp=dGLzVtb-zSkWb&md5=4122664e2cb8a1657d7c6d701ebf476d&ie=/sdarticle.pdf http://eprints.iisc.ernet.in/21344/ |
Palavras-Chave | #Aerospace Engineering (Formerly, Aeronautical Engineering) |
Tipo |
Journal Article PeerReviewed |