排序方式: 共有30条查询结果,搜索用时 15 毫秒
1.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
2.
3.
4.
The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001 相似文献
5.
测定了溶胀的PPU/PSAB 交联聚合物中链段和侧基的13CT1和NOE ,用VJGM模型和三等价位跃迁内旋转、扩散内旋转以及等价、不等价两位置跃迁内旋转模型分析了其中的主链链段运动和侧基内旋转运动 ,求出了主链和侧基的运动相关时间、扩散系数和活化能等参数 .结果表明PS含量对PPU运动的影响极小 ,PS主链运动活化能与PPU含量存在线性关系 .丙烯酸与苯乙烯共聚对PPU的运动几乎无影响 相似文献
6.
针对目标冲激响应及杂波冲激响应分布特性先验知识不准确导致的多输入多输出雷达检测性能下降的问题,提出恒模稳健波形与接收机滤波器联合优化算法。将目标冲激响应及杂波冲激响应分布特性先验知识不准确时的优化问题建模为一个极大极小化问题。运用迭代优化算法将联合优化问题分解为两个子优化步骤:将波形固定时的接收机滤波器权值优化问题建模为广义瑞利商模型,求解得到相应的接收机滤波器权值矢量;利用半正定松弛技术对权值固定时的波形优化问题进行求解,获得对应的波形矩阵,并根据得到的波形矩阵,通过高斯随机化的方法获得所需的恒模波形。对所提算法的收敛性进行了证明,仿真结果表明所提算法有效。 相似文献
7.
In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
8.
根据模型推导了主链运动忽略不计时的侧基多重内旋转运动的相关函数和谱密度函数 ,并用 NMR研究了离聚体乳胶 IPN( Io-LIPN)中 Pn BA侧基的 13C自旋 -晶格弛豫时间 T1.对测得的 T1进行了拟合 .结果表明离主链越远 ,Io-LIPN中聚丙烯酸丁酯的侧基基团内旋转运动速度越快 相似文献
9.
高速核入射到高温热平衡等离子体背景中,由于入射核动能远大于背景等离体中带电粒子之平均动能,入射核在与背景等离子体达到热平衡之前,会存在一段逐渐损失能量的非平衡弛豫过程。本文以高速氘核入射到高温氘化锂等离子体为例,在计及氘核的这种非平衡弛豫过程时,给出了一种计算热核反应D(t,n)~4He之反应率参数的方法。氘核在弛豫过程中的能量损失考虑了氘核与各种带电粒子的库仑散射过程,其能量损失率采用快速带电粒子的慢化理论来计算;氘与背景等离子体中的原子核发生的核反应过程,考虑了非平衡状态下束靶机制的D(t,n)~4He反应和热平衡状态下的D(t.n)~4He反应。在暂未考虑核散射的情况下,计算结果表明,当等离子体温度在7.5KeV~20KeV范围内变化时,氘核的非平衡弛豫过程对热平衡状态下D(t,n)~4He反应率参数的修正因子大致在1.0062~1.0943范围内变动,且温度越高,修正因子越小。计算还表明,当温度一定时,修正因子随等离子体中粒子的数密度变化不明显。 相似文献
10.
将多目标跟踪中的数据关联问题提成为一个离散最优化问题 ,并采用 L agrangian松驰算法来克服该问题面临的计算困难 ,这是目前多祯多目标测量数据关联研究发展的重要方向。首先将多祯多目标数据关联问题建立为一个带约束的多维分配问题 ;并在维数大于 2时 ,采用 L agrangian松驰算法来松驰约束条件 ,使问题降维为计算上可接受的二维分配问题。 相似文献