Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

被引：55

作者：

Kasperski, A ^{[1
]}

机构：

[1] Wroclaw Univ Technol, Inst Ind Engn & Management, PL-50370 Wroclaw, Poland

来源：

OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 04期

关键词：

sequencing; robust optimization; maximal regret;

D O I：

10.1016/j.orl.2004.07.004

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed. (c) 2004 Elsevier B.V. All rights reserved.

引用

页码：431 / 436

页数：6

共 7 条

[1] Minmax regret solutions for minimax optimization problems with uncertainty [J].

Averbakh, I .

OPERATIONS RESEARCH LETTERS, 2000, 27 (02) :57-65

[2]

BRUCKER P, 1998, SCHEDULING ALGORITHM

[3] ROBUST SCHEDULING TO HEDGE AGAINST PROCESSING TIME UNCERTAINTY IN SINGLE-STAGE PRODUCTION [J].

DANIELS, RL ;

KOUVELIS, P .

MANAGEMENT SCIENCE, 1995, 41 (02) :363-376

[4]

Kouvelis P., 1997, ROBUST DISCRETE OPTI

[5]

KOUVELIS P, 1996, ROBUST SCHEDULING 2

[6] OPTIMAL SEQUENCING OF A SINGLE MACHINE SUBJECT TO PRECEDENCE CONSTRAINTS [J].

LAWLER, EL .

MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 19 (05) :544-546

[7]

Yu G, 1993, COMPLEXITY NUMERICAL, P501

← 1 →