Title: Scheduling with Centralized and Decentralized Batching Policies in Concurrent Open Shops
Authors: Lin, B. M. T.
Cheng, T. C. E.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
Keywords: batch scheduling;centralized and decentralized decisions;concurrent open shop;dynamic programming
Issue Date: 1-Feb-2011
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 hatching 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. (C) 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17-27, 2011
URI: http://dx.doi.org/10.1002/nav.20437
ISSN: 0894-069X
DOI: 10.1002/nav.20437
Volume: 58
Issue: 1
Begin Page: 17
End Page: 27
Appears in Collections:Articles

Files in This Item:

  1. 000286857600002.pdf