Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19328
Title: Due-date assignment and single machine scheduling with compressible processing times
Authors: Cheng, TCE 
Oguz, C
Qi, XD
Keywords: Compression
Due-date assignment
Sequence
Issue Date: 1996
Publisher: Elsevier
Source: International journal of production economics, 1996, v. 43, no. 2-3, p. 107-113 How to cite?
Journal: International journal of production economics 
Abstract: In this paper we consider a due-date assignment and single-machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the due-dates, while in the second model the due-dates are assigned using the slack due-date assignment method. The objective is to determine the optimal sequence, the optimal due-dates and the optimal processing time compressions to minimize a total penalty function based on earliness, tardiness, due-dates and compressions. We solve the problem by formulating it as an assignment problem which is polynomially solvable. For the case that all the jobs have a common upper bound for compressions and an equal unit compression penalty, we present an O(n log n) algorithm to obtain the optimal solution.
URI: http://hdl.handle.net/10397/19328
ISSN: 0925-5273
DOI: 10.1016/0925-5273(96)00041-2
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

8
Last Week
0
Last month
0
Citations as of May 27, 2017

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of May 26, 2017

Page view(s)

37
Last Week
0
Last month
Checked on May 21, 2017

Google ScholarTM

Check

Altmetric



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