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

被引：13

作者：

Averbakh, Igor ^{[1
]}

Baysan, Mehmet ^{[1
]}

机构：

[1] Univ Toronto Scarborough, Dept Management, Toronto, ON M1C 1A4, Canada

来源：

OPERATIONS RESEARCH LETTERS | 2013年 / 41卷 / 06期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Supply chain scheduling; On-line algorithm; Competitive analysis; Integrated production-distribution problems;

D O I：

10.1016/j.orl.2013.10.002

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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 + alpha, where alpha is the ratio of the largest processing time to the smallest processing time. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：710 / 714

页数：5

共 6 条

[1]

[Anonymous], 2007, Scheduling Algorithms, DOI DOI 10.1007/978-3-540-69516-5

[2] On-line supply chain scheduling problems with preemption [J].

Averbakh, Igor ;

Xue, Zhihui .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) :500-504

[3] On-line integrated production-distribution scheduling problems with capacitated deliveries [J].

Averbakh, Igor .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (02) :377-384

[4] Supply chain scheduling: Conflict and cooperation in assembly systems [J].

Chen, Zhi-Long ;

Hall, Nicholas G. .

OPERATIONS RESEARCH, 2007, 55 (06) :1072-1089

[5] Integrated Production and Outbound Distribution Scheduling: Review and Extensions [J].

Chen, Zhi-Long .

OPERATIONS RESEARCH, 2010, 58 (01) :130-148

[6] Supply chain scheduling: Batching and delivery [J].

Hall, NG ;

Potts, CN .

OPERATIONS RESEARCH, 2003, 51 (04) :566-584

← 1 →