Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2013-07-01

Journal: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY

Included Journals: Scopus、EI、SCIE

Volume: 67

Issue: 1-4,SI

Page Number: 255-260

ISSN: 0268-3768

Key Words: Scheduling; Single machine; Resource allocation; Due date assignment; Deteriorating jobs

Abstract: We study a single-machine earliness-tardiness scheduling problem with due date assignment, in which the processing time of a job is a function of its starting time and its resource allocation. We analyze the problem with two different processing time functions and three different due date assignment methods. The goal is to minimize an integrated objective function, which includes earliness, tardiness, due date assignment, and total resource consumption costs. For each combination of due date assignment method and processing time function, we provide a polynomial-time algorithm to find the optimal job sequence, due date values, and resource allocations.