Hits:

Indexed by:期刊论文

Date of Publication:2015-02-01

Journal:APPLIED MATHEMATICAL MODELLING

Included Journals:SCIE、EI

Volume:39

Issue:3-4

Page Number:1172-1182

ISSN No.:0307-904X

Key Words:Scheduling; Deteriorating jobs; Single machine; Precedence constraint

Abstract:This paper deals with single machine scheduling problems with simple linear deterioration in which the processing time of a job is a simple linear function of its execution starting time. The objective is to determine the optimal schedule to minimize the weighted sum of the theta th (theta is a positive integer number) power of waiting times. It is proved that the general problem can be solved in polynomial time. In addition, for the jobs with weak (strong) parallel chains and a series-parallel digraph precedence constraints, it is also proved that these problems can be solved in polynomial time, respectively. (C) 2014 Elsevier Inc. All rights reserved.