IJPAM: Volume 28, No. 3 (2006)

SINGLE MACHINE SCHEDULING PROBLEM WITH
LINEAR DETERIORATION UNDER GROUP TECHNOLOGY

Fei Xu$^1$, Ai-Xia Guo$^2$, Ji-Bo Wang$^3$, Feng Shan$^4$
$^1$Department of Mathematics and Physics
Qingdao University of Science and Technology
Qingdao, 266061, P.R. CHINA
e-mail: xf_em@163.com
$^2$Basic Department
The Chinese People's Armed Police Forces Academy
Langfang, 065000, P.R. CHINA
e-mail: gax8118@163.com
$^{3,4}$Department of Science
Shenyang Institute of Aeronautical Engineering
Shenyang, 110034, P.R. CHINA
$^{3}$e-mail: wangjibo75@yahoo.com.cn


Abstract.This paper considers the single machine scheduling problem under the condition that the job processing time is a linear deterioration function of its starting time. Under the group technology assumption, the total weighted completion time minimization problem is polynomial time solvable.

Received: April 16, 2006

AMS Subject Classification: 90B35

Key Words and Phrases: scheduling, single machine, linear deterioration, total weighted completion time

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2006
Volume: 28
Issue: 3