An Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling

Jobs arriving over time must be non-preemptively processed on one of m parallel machines, each of which running at its own speed, so as to minimize a weighted sum of the job completion times. In this on-line environment, the processing requirement and weight of a job are not known before the job arr...

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: Chou, Mabel, Queyranne, Maurice, Simchi-Levi, David
Materyal Türü: Makale
Dil:en_US
Baskı/Yayın Bilgisi: 2003
Konular:
Online Erişim:http://hdl.handle.net/1721.1/3878