This paper addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-e€ectiveness in Japan's ports. The berth allocation to calling ships is a key factor for ecient public berthing. However, it is not calculated in polynomially-...

in this paper, a facility location problem of distribution systems, as one of the important and strategic issues in supply chain management, has been studied in a three-level supply chain under a stochastic condition. for this purpose, a two-stage mathematic model has been proposed for the location-allocation problem of distribution systems with regard to backup facilities for disrupting wareho...

We examine the effects of competition and decentralized ownership on resource scheduling. We show that centralized scheduling of multi-owned resources under imperfect information m y face dificulties that do not arise when resources are centrally owned. We pelfomz a simulation case study using a Lagrangian relaxation-based unit commitment algorithm modified to simulate proposed second-price poo...

To improve thequalityofdecisionmaking in theprocessoperations, it is essential to implement integrated planning and scheduling optimization. Major challenge for the integration lies in that the corresponding optimization problem is generally hard to solve because of the intractable model size. In this paper, ccepted 18 November 2009 vailable online 24 November 2009 eywords: lanning and scheduli...

We propose a new algorithm for approximate MAP inference on factor graphs, which combines augmented Lagrangian optimization with the dual decomposition method. Each slave subproblem is given a quadratic penalty, which pushes toward faster consensus than in previous subgradient approaches. Our algorithm is provably convergent, parallelizable, and suitable for fine decompositions of the graph. We...

The paper is concerned with the planning of training sessions in large organisations requiring periodic retraining of their staff. The allocation of students must take into account student preferences as well as the desired composition of study groups. The paper presents a bicriteria Quadratic Multiple Knapsack formulation of the considered practical problem, and a novel solution procedure base...

Performance aspects of a Lagrangian relaxation based heuris-tic for solving large 0-1 integer linear programs are discussed. In particular , we look at its application to airline and railway crew scheduling problems. We present a scalable parallelization of the original algorithm used in production at Carmen Systems AB, GG oteborg, Sweden, based on distributing the variables and a new sequentia...

In this paper, we address the rate control problem for layered multicast sessions, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of lagrangian relaxation and dynamic programming. Unlike previously proposed dual-based approaches, the algorithm presented in this paper scales well as the number of multicast groups in the network i...

This paper presents a location-inventory-pricing model for designing the distribution network of a supply chain with price-sensitive demands and inventory-capacity constraints. The supply chain has market power and uses markup pricing. An efficient Lagrangian relaxation algorithm is proposed to solve the model. Our numerical study shows that by moderately increasing the number of possible value...

Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to develop bounds for integer programming problems. We draw connections between these classical approaches and techniques based on generating strong valid inequalities. We also discuss several methods for incorporating dynamic cut generation into traditional decompositi...