Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20988
Title: Scheduling with centralized and decentralized batching policies in concurrent open shops
Authors: Lin, BMT
Cheng, TCE 
Keywords: Batch scheduling
Centralized and decentralized decisions
Concurrent open shop
Dynamic programming
Issue Date: 2011
Publisher: John Wiley & Sons
Source: Naval research logistics, 2011, v. 58, no. 1, p. 17-27 How to cite?
Journal: Naval research logistics 
Abstract: This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo-polynomial time algorithms for some problems that are NP-hard in the ordinary sense.
URI: http://hdl.handle.net/10397/20988
ISSN: 0894-069X
EISSN: 1520-6750
DOI: 10.1002/nav.20437
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Dec 10, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Dec 10, 2017

Page view(s)

55
Last Week
3
Last month
Checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric



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