IJPAM: Volume 18, No. 2 (2005)

SINGLE MACHINE SCHEDULING WITH
DETERIORATING JOBS UNDER
THE GROUP TECHNOLOGY ASSUMPTION

Ai-Xia Guo$^1$, Ji-Bo Wang$^2$
$^1$Department of Applied Mathematics
Dalian University of Technology
Dalian, 116024, P.R. CHINA
e-mail: [email protected]
$^2$Department of Science
Shenyang Institute of Aeronautical Engineering
Shenyang, 110034, P.R. CHINA
e-mail: [email protected]


Abstract.This paper discusses the 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 makespan problem is polynomial time solvable.

Received: November 18, 2004

AMS Subject Classification: 90B35

Key Words and Phrases: scheduling, single machine, linear deterioration, makespan

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2005
Volume: 18
Issue: 2