Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25920
Title: Single-machine scheduling and due date assignment with rejection and position-dependent processing times
Authors: Zhao, C
Yin, Y
Cheng, TCE 
Wu, CC
Keywords: Due date assignment
Position-dependent processing times
Rejection
Scheduling
Single machine
Issue Date: 2014
Publisher: American Institute of Mathematical Sciences
Source: Journal of industrial and management optimization, 2014, v. 10, no. 3, p. 691-700 How to cite?
Journal: Journal of industrial and management optimization 
Abstract: This paper considers a single-machine scheduling and due date assignment problem in which the processing time of a job depends on its position in a processing sequence and jobs can be rejected by incurring penalties. The objective is to minimize the sum of the scheduling criterion of the accepted jobs and the total penalty of the rejected jobs. We first consider the problem with the common due date assignment method where the scheduling criterion is a cost function that includes the costs of earliness, tardiness, and due date assignment. We provide a polynomial-time algorithm to solve the problem. We then provide a unified model for solving the single-machine scheduling problem with rejection and position-dependent processing times. Finally, we extend the results to the setting involving various due date assignment methods.
URI: http://hdl.handle.net/10397/25920
ISSN: 1547-5816
EISSN: 1553-166X
DOI: 10.3934/jimo.2014.10.691
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
0
Citations as of Aug 14, 2017

Page view(s)

47
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.