A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

We study on-line scheduling on parallel batch machines. Jobs arrive over time. A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch and all jobs in a batch start and are completed at the same time. The processing time of a batch is give...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scheduling Ročník 15; číslo 1; s. 77 - 81
Hlavní autoři: Liu, Peihai, Lu, Xiwen, Fang, Yang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.02.2012
Springer Science + Business Media
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Batch processing
Buffer inventories
Business and Management
Calculus of Variations and Optimal Control; Optimization
Competition
Handles
On-line systems
Operations Research/Decision Theory
Optimization
Parallel processing
Production scheduling
Release dates
Schedules
Scheduling
Studies
Supply Chain Management
On-line
Scheduling
Parallel Batch Machines
ISSN:1094-6136, 1099-1425
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study on-line scheduling on parallel batch machines. Jobs arrive over time. A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch and all jobs in a batch start and are completed at the same time. The processing time of a batch is given by the processing time of the longest job in the batch. The objective is to minimize the makespan. We deal with the unbounded model, where B is sufficiently large. We first show that no deterministic on-line algorithm can have a competitive ratio of less than , where m is the number of parallel batch machines. We then present an on-line algorithm which is the one best possible for any specific values of  m .
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-009-0154-4