Sciweavers

42 search results - page 4 / 9
» eor 2002
Sort
View
EOR
2002
75views more  EOR 2002»
13 years 9 months ago
A structured groupware for a collective decision-making aid
: We present the groupware MEMO-Net which aim is to support collective problem solving and to memorize all exchanged arguments. This groupware is based on a knowledgestructuring me...
Myriam Lewkowicz, Manuel Zacklad
EOR
2002
79views more  EOR 2002»
13 years 9 months ago
Fast fully polynomial approximation schemes for minimizing completion time variance
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo...
EOR
2002
80views more  EOR 2002»
13 years 9 months ago
On generalized semi-infinite optimization and bilevel optimization
The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a sp...
Oliver Stein, Georg Still
EOR
2002
84views more  EOR 2002»
13 years 9 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
EOR
2002
105views more  EOR 2002»
13 years 9 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler