Scheduling with centralized and decentralized batching policies in concurrent open shops

Miao-Tsong Lin, T. C.E. Cheng

研究成果: Article同行評審

6 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)17-27
頁數11
期刊Naval Research Logistics
58
發行號1
DOIs
出版狀態Published - 1 二月 2011

指紋 深入研究「Scheduling with centralized and decentralized batching policies in concurrent open shops」主題。共同形成了獨特的指紋。

引用此