Scheduling with centralized and decentralized batching policies in concurrent open shops

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 po...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Naval research logistics Ročník 58; číslo 1; s. 17 - 27
Hlavní autori: Lin, B. M. T., Cheng, T. C. E.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.02.2011
Wiley Subscription Services, Inc
Predmet:
Algorithms
batch scheduling
centralized and decentralized decisions
concurrent open shop
Decentralized
dynamic programming
Lateness
Logistics
Machine shops
Naval
Policies
Scheduling
ISSN:0894-069X, 1520-6750, 1520-6750
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011
Bibliografia:ark:/67375/WNG-WHHKXH68-B
istex:942C5AAF490D5611C976CBEA93CC11D44431045E
ArticleID:NAV20437
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0894-069X
1520-6750
1520-6750
DOI:10.1002/nav.20437