Some results of the worst-case analysis for flow shop scheduling with a learning effect

被引：0

作者：

Lin-Hui Sun

Kai Cui

Ju-Hong Chen

Jun Wang

Xian-Chen He

机构：

[1] Xi’an University of Science and Technology,The School of Management

[2] The State Key Laboratory for Manufacturing Systems Engineering,School of Management Engineering

[3] System Efficiency and Human Safety Ergonomics Institute of Xi’an University of Science and Technology,The School of Economics and Management

[4] Knowledge Management & Innovation Research Centre of Xi’an Jiaotong University,undefined

[5] Xi’an University of Posts & Telecommunications,undefined

[6] Xi’an University of Technology,undefined

来源：

Annals of Operations Research | 2013年 / 211卷

关键词：

Scheduling; Flow shop; Worst-case analysis; Learning effect;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

This article considers flow shop scheduling problems with a learning effect. By the learning effect, we mean that the processing time of a job is defined by a function of its position in a processing permutation. The objective is to minimize the total weighted completion time. Some heuristic algorithms by using the optimal permutations for the corresponding single machine scheduling problems are presented, and the worst-case bound of these heuristics are also analyzed.

引用

页码：481 / 490

页数：9

共 50 条

[21] SOME NEW RESULTS IN FLOW SHOP SCHEDULING.
Roeck, Hans
ZOR. Zeitschrift fur Operations-Research, 1984, 28 (01): : 1 - 16
[22] Flow-shop scheduling with a learning effect
Wang, JB
Xia, ZQ
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (11) : 1325 - 1330
[23] Results on worst-case performance assessment
Packard, A
Balas, G
Liu, R
Shin, JY
PROCEEDINGS OF THE 2000 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2000, : 2425 - 2427
[24] The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
Chang, SY
Hwang, HC
DISCRETE APPLIED MATHEMATICS, 1999, 92 (2-3) : 135 - 147
[25] Beyond Worst-Case Analysis
Roughgarden, Tim
COMMUNICATIONS OF THE ACM, 2019, 62 (03) : 88 - 96
[26] Worst-Case Analysis of an Approximation Algorithm for Single Machine Scheduling Problem
Grigoreva, Natalia
PROCEEDINGS OF THE 2021 16TH CONFERENCE ON COMPUTER SCIENCE AND INTELLIGENCE SYSTEMS (FEDCSIS), 2021, : 221 - 225
[27] WORST-CASE ANALYSIS OF ALGORITHMS
VANTRIGT, C
PHILIPS JOURNAL OF RESEARCH, 1978, 33 (1-2) : 66 - 77
[28] Worst-case Structural Analysis
Zhou, Qingnan
Panetta, Julian
Zorin, Denis
ACM TRANSACTIONS ON GRAPHICS, 2013, 32 (04):
[29] On Worst-Case Learning in Relativized Heuristica
Hirahara, Shuichi
Nanashima, Mikito
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 751 - 758
[30] On the worst-case analysis of temporal-difference learning algorithms
Schapire, RE
Warmuth, MK
MACHINE LEARNING, 1996, 22 (1-3) : 95 - 121

← 1 2 3 4 5 →