ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences

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.

[img] PDF
m.pdf - Published Version
Restricted to Registered users only

Download (519Kb) | Request a copy
Official URL: http://www.sciencedirect.com/science?_ob=MImg&_ima...

Abstract

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.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier Science.
Keywords: Single machine scheduling;Bi-criteria problem;Learning effect;Non-dominated solution
Department/Centre: Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)
Date Deposited: 09 Jul 2009 08:14
Last Modified: 19 Sep 2010 05:37
URI: http://eprints.iisc.ernet.in/id/eprint/21344

Actions (login required)

View Item View Item