Johan Marklund - Academia.edu (original) (raw)

Papers by Johan Marklund

European Journal of Operational Research, 2008

We consider the separable nonlinear and strictly convex single-commodity network flow problem (SS... more We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution from any Lagrangian dual vector; this is referred to as "early primal recovery". It is motivated by the desire to obtain a primal feasible vector before convergence of a Lagrangian scheme; such a vector is not available from a Lagrangian dual vector unless it is optimal. The scheme is constructed such that if we apply it from a sequence of Lagrangian dual vectors that converge to an optimal one, then the resulting primal (feasible) vectors converge to the unique optimal primal flow vector. It is therefore also a convergent Lagrangian heuristic, akin to those primarily devised within the field of combinatorial optimization but with the contrasting and striking advantage that it is guaranteed to yield a primal optimal solution in the limit. Thereby we also gain access to a new stopping criterion for any Lagrangian dual algorithm for the problem, which is of interest in particular if the SSCNFP arises as a subproblem in a more complex model. We construct instances of convergent Lagrangian heuristics that are based on graph searches within the residual graph, and therefore are efficiently implementable; in particular we consider two shortest path based heuristics that are based on the optimality conditions of the original problem. Numerical experiments report on the relative efficiency and accuracy of the various schemes.

Commonly Used Extend Blocks BPR Library Discrete Event Library Decision 5 (2) '? Decision &g... more Commonly Used Extend Blocks BPR Library Discrete Event Library Decision 5 (2) '? Decision >,;11 C5) Export p Operation M Operation, Reverse Operation, Variable M Import "IT" Labor ^ Poo, Measure-Merge ft Repository Stack Transaction Transaction, Preemptive Generic ...

European Journal of Operational Research

Operations Research, 2016

DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

Springer Series in Supply Chain Management, 2016

Encyclopedia of Library and Information Sciences, Third Edition, 2009

International Journal of Production Reserch, 2014

Proceedings 2 a Utvecklingskonferensen For Sveriges Ingenjorsutbildningar, 2009

European Journal of Operational Research, 2000

We consider a model for decentralized inventory control in a two-level distribution system with o... more We consider a model for decentralized inventory control in a two-level distribution system with one central warehouse and N non-identical retailers. All installations use continuous review installation stock RY Q-policies for replenishing their inventories. Our approach is based on an approximate cost evaluation technique, where the retailers replace their stochastic lead-times by correct averages. By introducing a modi®ed cost-structure at the warehouse, the multi-level inventory control problem can be decomposed into N 1 single level sub-problems, one problem for each installation. The sub-problems are then solved in an iterative manner by a simple coordination procedure, which can be interpreted as a negotiation process. In the case of normally distributed demand we show that the procedure converges to a near optimal solution. To assess the quality of the involved approximation an upper bound for the relative cost increase of using the obtained solution is derived. We also provide a numerical study illustrating the performance of our approach.

... management using computer based simulation Johan Lundin and Johan Marklund Department of Indu... more ... management using computer based simulation Johan Lundin and Johan Marklund Department of Industrial Management and Logistics Lund University, Faculty of Engineering ... 23-26. [3] Dewey, J., (1938), Experience and Education, Macmillan, New York, 1938. ...

Thesis (Doctoral)--Division of Production Management, Lund Institute of Technology, Lund Universi... more Thesis (Doctoral)--Division of Production Management, Lund Institute of Technology, Lund University, December, 1999. Includes bibliographical references. "ISSN: 0280-722X; ISRN: LUTMDN/TMIO-1009-SE."

Operations Research, 2006