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

Igor Averbakh; Mehmet Baysan

doi:10.1016/j.orl.2013.10.002

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

Igor Averbakh^*
, Mehmet Baysan

^*Bu çalışma için yazışmadan sorumlu yazar

University of Toronto

Araştırma çıktısı: Dergi yayını › Makale › Hakem

14 Atıf (Scopus)

Özet

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.

Orijinal dil	İngilizce
Sayfa (başlangıç-bitiş)	710-714
Sayfa sayısı	5
Dergi	Operations Research Letters
Hacim	41
Basın numarası	6
DOI'lar	https://doi.org/10.1016/j.orl.2013.10.002
Yayın durumu	Yayınlandı - 2013
Harici olarak yayınlandı	Evet

Finansman

This work was supported by a grant from the Natural Sciences and Engineering Research Council of Canada (NSERC) to the first author.

Finansörler
Natural Sciences and Engineering Research Council of Canada

Belgeye Erişim

10.1016/j.orl.2013.10.002

Diğer Dosyalar ve Linkler

Link to publication in Scopus

Alıntı Yap

@article{a3bcb10ecdf44d11923fa911068f9d37,

title = "Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem",

abstract = "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.",

keywords = "Competitive analysis, Integrated production-distribution problems, On-line algorithm, Supply chain scheduling",

author = "Igor Averbakh and Mehmet Baysan",

year = "2013",

doi = "10.1016/j.orl.2013.10.002",

language = "English",

volume = "41",

pages = "710--714",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

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

AU - Averbakh, Igor

AU - Baysan, Mehmet

PY - 2013

Y1 - 2013

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

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

KW - Competitive analysis

KW - Integrated production-distribution problems

KW - On-line algorithm

KW - Supply chain scheduling

UR - https://www.scopus.com/pages/publications/84886217134

U2 - 10.1016/j.orl.2013.10.002

DO - 10.1016/j.orl.2013.10.002

M3 - Article

AN - SCOPUS:84886217134

SN - 0167-6377

VL - 41

SP - 710

EP - 714

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

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

Özet

Finansman

Belgeye Erişim

Diğer Dosyalar ve Linkler

Parmak izi

Alıntı Yap