Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19483
Title: Optimal due-date assignment problem with learning effect and resource-dependent processing times
Authors: Lu, YY
Li, G
Wu, YB
Ji, P 
Keywords: Due-date assignment
Learning effect
Resource allocation
Scheduling
Single-machine
Issue Date: 2012
Publisher: Springer
Source: Optimization letters, 2012, p. 1-15 How to cite?
Journal: Optimization letters 
Abstract: In this paper, we consider a single-machine earliness-tardiness scheduling problem with due-date assignment, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The due date assignment methods studied include the common due date, and the slack due date, which reflects equal waiting time allowance for the jobs. 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 that minimize an integrated objective function, which includes earliness, tardiness, due date assignment, and total resource consumption costs.
URI: http://hdl.handle.net/10397/19483
ISSN: 1862-4472
EISSN: 1862-4480
DOI: 10.1007/s11590-012-0467-7
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

18
Last Week
0
Last month
0
Citations as of Aug 11, 2017

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
Citations as of Aug 12, 2017

Page view(s)

38
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.