Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30248
Title: Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity
Authors: Yin, Y
Cheng, TCE 
Wu, CC
Cheng, SR
Keywords: Batching
Common due-date assignment
Rate-modifying activity
Scheduling
Issue Date: 2014
Publisher: Taylor and Francis Ltd.
Source: International journal of production research, 2014, v. 52, no. 19, p. 5583-5596 How to cite?
Journal: International Journal of Production Research 
Abstract: We consider batch delivery scheduling on a single machine, where a common due-date is assigned to all the jobs and a rate-modifying activity on the machine may be scheduled, which can change the processing rate of the machine. Thus the actual processing time of a job is variable depending on whether it is processed before or after the rate-modifying activity. The objective is to determine the optimal job sequence, the optimal partition of the job sequence into batches, the optimal assigned common due-date, and the optimal location of the rate-modifying activity simultaneously to minimize the total cost of earliness, job holding, weighted number of tardy jobs, due-date assignment, and batch delivery. We derive some structural properties of the problem, based on which we design polynomial-time algorithms to solve some special cases of the problem.
URI: http://hdl.handle.net/10397/30248
ISSN: 0020-7543
DOI: 10.1080/00207543.2014.886027
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Jun 22, 2017

WEB OF SCIENCETM
Citations

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

Page view(s)

35
Last Week
0
Last month
Checked on Jun 18, 2017

Google ScholarTM

Check

Altmetric



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