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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 15; no. 1; pp. 77 - 81
Main Authors:	Liu, Peihai, Lu, Xiwen, Fang, Yang
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2012 Springer Science + Business Media Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!