Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/7924
Title: Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost
Authors: Yin, Y
Cheng, TCE 
Xu, D
Wu, CC
Keywords: Batch delivery
Due date assignment
Rate-modifying activity
Scheduling
Issue Date: 2012
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2012, v. 63, no. 1, p. 223-234 How to cite?
Journal: Computers and industrial engineering 
Abstract: e consider a single-machine batch delivery scheduling and common due date assignment problem. In addition to making decisions on sequencing the jobs, determining the common due date, and scheduling job delivery, we consider the option of performing a rate-modifying activity on the machine. The processing time of a job scheduled after the rate-modifying activity decreases depending on a job-dependent factor. Finished jobs are delivered in batches. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed and independent of the number of jobs in the batch. The objective is to find a common due date for all the jobs, a location of the rate-modifying activity, and a delivery date for each job to minimize the sum of earliness, tardiness, holding, due date, and delivery cost. We provide some properties of the optimal schedule for the problem and present polynomial algorithms for some special cases.
URI: http://hdl.handle.net/10397/7924
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2012.02.015
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

30
Last Week
0
Last month
2
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

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

Page view(s)

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