Scheduling with Centralized and Decentralized Batching Policies in Concurrent Open Shops
檔案
- 000286857600002.pdf (138.4 KB, Adobe PDF)
日期
2011-02-01
類型
期刊名稱
NAVAL RESEARCH LOGISTICS
卷期與頁次
第 58 卷第 1 期,頁 17–27
ISSN
0894-069X
語言
英文
摘要
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
所屬典藏
期刊論文引用此條目
Lin, B. M. T., & Cheng, T. C. E. (2011). Scheduling with Centralized and Decentralized Batching Policies in Concurrent Open Shops. NAVAL RESEARCH LOGISTICS, 58(1), 17–27. https://doi.org/10.1002/nav.20437
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/25832