Heuristic algorithms for the minmax regret flow-shop problem with interval processing times [0.03%]
含区间加工时间的最小遗憾流水车间调度问题的启发式算法研究
Michał Ćwik,Jerzy Józefczyk
Michał Ćwik
An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is ...
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum [0.03%]
两类优化值已知的两台不同速度均匀机器半在线 scheduling 问题的最紧界研究
György Dósa,Armin Fügenschuh,Zhiyi Tan et al.
György Dósa et al.
We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next j...
Bogumił Kamiński,Michał Jakubczyk,Przemysław Szufel
Bogumił Kamiński
In the paper, we consider sequential decision problems with uncertainty, represented as decision trees. Sensitivity analysis is always a crucial element of decision making and in decision trees it often focuses on probabilities. In the stoc...
Measuring inefficiency for specific inputs using data envelopment analysis: evidence from construction industry in Spain and Portugal [0.03%]
基于数据包络分析的特定投入无效性度量：来自西班牙和葡萄牙建筑行业的证据
Magdalena Kapelko
Magdalena Kapelko
This article contributes to the efficiency literature by defining, in the context of the data envelopment analysis framework, the directional distance function approach for measuring both technical and scale inefficiencies with regard to th...
Newsvendor problem under complete uncertainty: a case of innovative products [0.03%]
完全不确定性下的新闻报童问题——一种创新型产品的情况研究
Helena Gaspars-Wieloch
Helena Gaspars-Wieloch
The paper presents a new scenario-based decision rule for the classical version of the newsvendor problem (NP) under complete uncertainty (i.e. uncertainty with unknown probabilities). So far, NP has been analyzed under uncertainty with kno...
Generating subtour elimination constraints for the TSP from pure integer solutions [0.03%]
从纯整数解生成TSP的子回路消除约束条件
Ulrich Pferschy,Rostislav Staněk
Ulrich Pferschy
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph [Formula: see text] and non-negative distances d for every edge, the TSP asks for a shortest tour through all vert...