Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31303
Title: Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time
Authors: Yin, Y
Cheng, TCE 
Wu, CC
Cheng, SR
Keywords: Controllable processing times
Due window assignment
Resource allocation
Scheduling
Issue Date: 2014
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2014, v. 65, no. 1, p. 1-13 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: In this paper, we consider single-machine due window assignment and scheduling with a common flow allowance and controllable job processing times, subject to unlimited or limited resource availability. Due window assignment with a common flow allowance means that each job has a job-dependent due window, the starting time and completion time of which are equal to its actual processing time plus the job-independent parameters q 1 and q 2, respectively, which are common to all the jobs. The processing time of each job is either a linear or a convex function of the amount of a common continuously divisible resource allocated to the job. We study five versions of the problem that differ in terms of the objective function and processing time function being used. We provide structural properties of the optimal schedules and polynomial-time solution algorithms for the considered problems.
URI: http://hdl.handle.net/10397/31303
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/jors.2012.161
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

28
Last Week
0
Last month
1
Citations as of Aug 13, 2017

WEB OF SCIENCETM
Citations

20
Last Week
1
Last month
1
Citations as of Aug 14, 2017

Page view(s)

53
Last Week
4
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.