Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8049
Title: Processing-plus-wait due dates in single-machine scheduling
Authors: Kahlbacher, HG
Cheng, TCE 
Keywords: Due dates
Earliness
Single-machine scheduling
Tardiness
Issue Date: 1995
Publisher: Springer
Source: Journal of optimization theory and applications, 1995, v. 85, no. 1, p. 163-186 How to cite?
Journal: Journal of optimization theory and applications 
Abstract: We study the problem of scheduling n jobs on a single machine. Each job is assigned a processing-plus-wait due date, which is an affine-linear function of its processing time. The objective is to minimize the symmetric earliness and tardiness costs. We analyze a combined decision model which includes computing both the optimal job sequence and optimal due date parameters. For the quadratic objective function, we propose a heuristic solution based on a bicriterion approach. Additionally, we provide computational results to compare this model with two simpler models. For the maximum objective function, we show that it is efficiently solved by the shortest processing time sequence.
URI: http://hdl.handle.net/10397/8049
ISSN: 0022-3239
EISSN: 1573-2878
DOI: 10.1007/BF02192303
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Aug 21, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
Citations as of Aug 20, 2017

Page view(s)

44
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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