Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33196
Title: Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times
Authors: Yin, Y
Cheng, TCE 
Wu, CC
Cheng, SR
Keywords: Production planning
Scheduling
Issue Date: 2013
Source: International journal of production research, 2013, v. 51, no. 17, p. 5083-5099 How to cite?
Journal: International Journal of Production Research 
Abstract: In this paper we consider the problem of single-machine batch delivery scheduling with an assignable common due date and controllable processing times. The job processing time is either a linear or a convex function of the amount of a continuously divisible and non-renewable resource allocated to the job. Finished jobs are delivered in batches and there is no capacity limit on each delivery batch. The objective is to find a job sequence, a partition of the job sequence into batches, a common due date, and resource allocation that jointly minimise a cost function based on earliness, weighted number of tardy jobs, job holding, due-date assignment, batch delivery, makespan, and resource consumption. We provide some properties of the optimal solution, and show that the problem with the linear and convex resource consumption functions can be solved in and time, respectively. We also show that some special cases of the problem can be solved by lower-order algorithms.
URI: http://hdl.handle.net/10397/33196
ISSN: 0020-7543
DOI: 10.1080/00207543.2013.793424
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

23
Last Week
0
Last month
1
Citations as of Jun 22, 2017

WEB OF SCIENCETM
Citations

19
Last Week
0
Last month
0
Citations as of Jun 23, 2017

Page view(s)

33
Last Week
1
Last month
Checked on Jun 25, 2017

Google ScholarTM

Check

Altmetric



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