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

Authors:
V. Mani;Pei Chann Chang;Shih Hsin Chen
Affiliations:
Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India;Department of Information Management, Yuan Ze University, 135, Yuan-Dong Road, Tao-Yuan 32026, Taiwan ROC;Department of Electronic Commerce Management, Nanhua University, 32,Chungkeng, Dalin, Chiayi 62248, Taiwan ROC
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 6
Cited 1

Simultaneous minimization of mean and variation flow time and waiting in single machine systems

Operations Research
On the minimization of completion time variance with a bicriteria extension

Operations Research
A bi-criterion single-machine scheduling problem with learning considerations

Acta Informatica
Minimizing the makespan in a single machine scheduling problem with a time-based learning effect

Information Processing Letters
The learning effect: Getting to the core of the problem

Information Processing Letters
A new approach to the learning effect: Beyond the learning curve restrictions

Computers and Operations Research

Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.09

Visualization

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 solving 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.