Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2013-02-15

Journal: APPLIED MATHEMATICAL MODELLING

Included Journals: EI、SCIE

Volume: 37

Issue: 4

Page Number: 2388-2393

ISSN: 0307-904X

Key Words: Scheduling; Single-machine; Deteriorating jobs; Resource allocation

Abstract: In this study, we consider scheduling problems with convex resource dependent processing times and deteriorating jobs, in which the processing time of a job is a function of its starting time and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately. This paper focus on the single-machine problems with objectives of minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost, and a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. It shows that the problems remain polynomially solvable under the proposed model. (C) 2012 Elsevier Inc. All rights reserved.