Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24724
Title: Parallel-machine batching and scheduling to minimize total completion time
Authors: Cheng, TCE 
Chen, ZL
Kovalyov, MY
Lin, BMT
Issue Date: 1996
Publisher: Taylor & Francis
Source: IIE transactions, 1996, v. 28, no. 11, p. 953-956 How to cite?
Journal: IIE transactions 
Abstract: We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on m identical parallel machines. The jobs have to be batched as well as scheduled. The completion time of a job is defined as the completion time of the batch containing it. A constant set-up time is incurred whenever a batch is formed. The problem is to batch and schedule jobs so that the total completion time of the jobs is minimized. We first present some properties and then develop a dynamic programming algorithm to solve this problem. The running time of our algorithm is O(mnm+1). When job processing times are identical, we show that the problem reduces to the corresponding single-machine problem, which has been well solved in the literature.
URI: http://hdl.handle.net/10397/24724
ISSN: 0740-817X
EISSN: 1545-8830
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

29
Last Week
0
Last month
Citations as of Apr 30, 2016

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
0
Citations as of Aug 16, 2017

Page view(s)

76
Last Week
1
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check



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