Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32395
Title: Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time
Authors: Yuan, JJ
Lin, YX
Cheng, TCE 
Ng, CT 
Keywords: Batch size
Batching
Scheduling
Issue Date: 2007
Source: International journal of production economics, 2007, v. 105, no. 2, p. 402-406 How to cite?
Journal: International Journal of Production Economics 
Abstract: In this paper we consider the single machine serial-batching scheduling problem to minimize total weighted completion time with the restriction that each batch contains exactly k jobs. We show that this problem is strongly NP-hard even when the batch size is 3 and the weight of each job is equal to its processing time. We also give O (n log n) time algorithms for the following two special cases: (1) the jobs are inversely agreeable, i.e., pi < pj implies wi ≥ wj; (2) the batch size is 2 and the weights of the jobs are proportional to their processing times, i.e., wj = α pj for a constant α > 0.
URI: http://hdl.handle.net/10397/32395
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2004.04.014
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Apr 21, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
0
Citations as of Apr 19, 2017

Page view(s)

38
Last Week
1
Last month
Checked on Apr 23, 2017

Google ScholarTM

Check

Altmetric



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