Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem

Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem

A manufacturer has to process jobs released on-line and deliver them to customers. Preemption is allowed. Jobs are grouped into batches for delivery. The sum of the total flow time and the total delivery cost is minimized. Deliveries to different customers cannot be combined. We present an on-line a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters 2013-11, Vol.41 (6), p.710-714
Hauptverfasser: Averbakh, Igor, Baysan, Mehmet
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Competitive analysis
Cost engineering
Customers
Delivery scheduling
Integrated production–distribution problems
Mathematical analysis
On-line algorithm
On-line systems
Operations research
Supply chain scheduling
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A manufacturer has to process jobs released on-line and deliver them to customers. Preemption is allowed. Jobs are grouped into batches for delivery. The sum of the total flow time and the total delivery cost is minimized. Deliveries to different customers cannot be combined. We present an on-line algorithm with the competitive ratio bounded by 3+α, where α is the ratio of the largest processing time to the smallest processing time.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2013.10.002