DOCSLIB.ORG

Book of Abstracts Third International Workshop on Lot-Sizing IWLS 2012

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Book of Abstracts Third International Workshop on Lot-Sizing IWLS 2012 27 – 29 August 2012 Rotterdam, Netherlands Organised by Erasmus University Rotterdam Cover picture by Marc Heeman. ii Contents Organisation vi Participants vii Programme viii Foreword xi Extended Abstracts 3 1 Incorporating Consumer Purchasing Behaviour on the Production Planning of Food Goods 3 Pedro Amorim, Gon¸caloFigueira, Alysson Costa and Bernardo Almada-Lobo 2 A new heuristic for the non-stationary (s, S) policy 7 Onur A. Kılı¸cand S. Arma˘ganTarım 3 The Horizon Decomposition Approach for Capacity Constrained Lot Size Prob- lems with Setup Times 9 Ioannis Fragkos, Zeger Degraeve and Bert De Reyck 4 Extending a Math-heuristic for Capacitated Lot Sizing towards a Hierarchical Solution Approach 12 Marco Caserta and Stefan Voß 5 An iterative two-phase heuristic approach for the Production Routing Problem 16 Nabil Absi, Claudia Archetti, St´ephaneDauz`ere-P´er`esand Dominique Feillet 6 A Study of Integrated Lot Sizing and Cutting Stock Models for a Furniture Plant 20 Silvio A. de Araujo, Socorro Rangel and Matheus Vanzela 7 Integrated non-increasing capacitated lot sizing problem and preventive main- tenance 23 Fahimeh Shamsaei and Mathieu Van Vyve iii 8 Capacitated lot sizing problem with inventory bounds 25 Ayse Akbalik, Bernard Penz and Christophe Rapine 9 The Capacitated Lot-Sizing Problem with Piecewise Concave Production Costs 29 Esra Koca, Hande Yaman and M. Selim Akturk 10 Two-Period Convex Hull Closures for Big Bucket Lotsizing Problems 33 Kerem Akartunalı and Andrew J. Miller 11 Relaxations for two-level multi-item lot-sizing problem 36 Mathieu Van Vyve, Laurence A. Wolsey and Hande Yaman 12 Semidefinite relaxation of the DLSP with sequence-dependent changeover costs 39 C´elineGicquel, Abdel Lisser and Michel Minoux 13 An Integrated Approach for Solving Multi-Level Lot-Sizing and Scheduling Problems with Detailed Capacity Constraints 43 Edwin David G´omezUrrutia, Riad Aggoune and St´ephaneDauz`ere-P´er`es 14 Modeling approaches to sequence dependent setups in lotsizing and schedul- ing 47 Luis Guimar˜aes,Diego Klabjan and Bernardo Almada-Lobo 15 Complexity results for the single item uncapacitated lot-sizing problem with time-dependent batch sizes 52 Ayse Akbalik and Christophe Rapine 16 Lot-sizing with minimum batch sizes 56 Mathijn J. Retel Helmrich, Wilco van den Heuvel, Raf Jans and Albert P. M. Wagelmans 17 Dynamic capacitated lot-sizing with parallel common setup operators 59 Karina Copil and Horst Tempelmeier 18 First Results on Multi-Level Capacitated Lot-Sizing in Closed-Loop Supply Chains 62 Florian Sahling and Kristina Burmeister 19 Linear programming models for the stochastic dynamic capacitated lot sizing problem 66 Timo Hilger and Horst Tempelmeier 20 Static-Dynamic Uncertainty Strategy for a Single-Item Stochastic Inventory Con- trol Problem 70 iv Ula¸s Ozen,¨ Mustafa K. Do˘grunand S. Arma˘ganTarım 21 Effective Network Models for the Two-Level Serial Lot Sizing Problems 73 Meltem Denizel, O˘guzSolyalı and Haldun S¨ural 22 A Single Phase Dynamic Program with Independent Production Decision for Production-Capacitated Two- and Multi-Stage Lot-Sizing Problems 76 Hark-Chin Hwang, Hyun-soo Ahn and Philip Kaminsky 23 The Single-Item Green Lot-Sizing Problem with Fixed Carbon Emissions 79 Nabil Absi, St´ephaneDauz`ere-P´er`es,Safia Kedad-Sidhoum and Bernard Penz 24 Bi-Objective Economic Lot-Sizing problems 82 Wilco van den Heuvel, H. Edwin Romeijn and Dolores Romero Morales Author Index 87 v Organisation Local Organising Committee Wilco van den Heuvel Erasmus University Rotterdam Albert Wagelmans Erasmus University Rotterdam Mathijn Retel Helmrich Erasmus University Rotterdam Steering Committee Nabil Absi (France) Bernardo Almada-Lobo (Portugal) Stephane´ Dauzere-P` er´ es` (France) Meltem Denizel (Turkey) Hark-Chin Hwang (South Korea) Raf Jans (Canada) Safia Kedad-Sidhoum (France) Atle Nordli (Norway) H. Edwin Romeijn (USA) Horst Tempelmeier (Germany) Laurence A. Wolsey (Belgium) vi Participants First Name Last Name Country Nabil Absi France Kerem Akartunalı UK Ayse Akbalik France Bernardo Almada-Lobo Portugal Pedro Amorim Portugal Karina Copil Germany Stephane´ Dauzere-P` er´ es` France Silvio A. de Araujo Brazil Meltem Denizel Turkey Gonc¸alo Figueira Portugal Ioannis Fragkos UK Celine´ Gicquel France Lus Guimaraes˜ Portugal Timo Hilger Germany Hark-Chin Hwang Korea C¸agatay˘ Iris˙ Turkey Safia Kedad-Sidhoum France Onur A. Kılıc¸ Turkey Alf Kimms Germany Esra Koca Turkey Dong Li UK Zahra Mobini Dehkordi Netherlands Atle Nordli Norway Ulas¸ Ozen¨ Ireland Christopher Rapine France Mathijn Retel Helmrich Netherlands Edwin Romeijn USA Dolores Romero Morales UK Florian Sahling Germany Fahimeh Shamsaei Begium Oguz˘ Solyalı North Cyprus Haldun Sural Turkey Horst Tempelmeier Germany Wilco van den Heuvel Netherlands Stan van Hoesel Netherlands Mathieu Van Vyve Belgium Stefan Voß Germany Albert P.M. Wagelmans Netherlands Martin Woerbelauer Germany Laurence A. Wolsey Belgium Hande Yaman Turkey Mehmet Mutlu Yenisey Turkey vii Programme Time Sunday 26 August 2012 19:00-21:30 Welcome Dinner Monday 27 August 8:30-9:00 Welcome and Registration 9:00-9:30 Opening Session 9:30-10:50 Incorporating Consumer Purchasing Behaviour on the Production Plan- ning of Food Goods Pedro Amorim, Gonc¸alo Figueira, Alysson Costa and Bernardo Almada- Lobo A new heuristic for the non-stationary (s, S) policy Onur A. Kılı¸c and S. Armagan˘ Tarım 10:50-11:20 Coffee Break 11:20-12:40 The Horizon Decomposition Approach for Capacity Constrained Lot Size Problems with Setup Times Ioannis Fragkos, Zeger Degraeve and Bert De Reyck Extending a Math-heuristic for Capacitated Lot Sizing towards a Hierar- chical Solution Approach Marco Caserta and Stefan Voß 12:40-13:40 Lunch 13:40-15:40 An iterative two-phase heuristic approach for the Production Routing Problem Nabil Absi, Claudia Archetti, Stephane´ Dauzere-P` er´ es` and Dominique Feillet A Study of Integrated Lot Sizing and Cutting Stock Models for a Furni- ture Plant Silvio A. de Araujo, Socorro Rangel and Matheus Vanzela Integrated non-increasing capacitated lot sizing problem and preventive maintenance Fahimeh Shamsaei and Mathieu Van Vyve 15:40-16:10 Coffee Break 16:10-17:30 Capacitated lot sizing problem with inventory bounds Ayse Akbalik, Bernard Penz and Christophe Rapine The Capacitated Lot-Sizing Problem with Piecewise Concave Production Costs Esra Koca, Hande Yaman and M. Selim Akturk 17:30-18:30 Drinks viii Time Tuesday 28 August 9:00-10:20 Two-Period Convex Hull Closures for Big Bucket Lotsizing Problems Kerem Akartunalı and Andrew J. Miller Relaxations for two-level multi-item lot-sizing problem Mathieu Van Vyve, Laurence A. Wolsey and Hande Yaman 10:20-10:50 Coffee Break 10:50-12:50 Semidefinite relaxation of the DLSP with sequence-dependent changeover costs C´elineGicquel, Abdel Lisser and Michel Minoux An Integrated Approach for Solving Multi-Level Lot-Sizing and Scheduling Problems with Detailed Capacity Constraints Edwin David Gomez´ Urrutia, Riad Aggoune and St´ephaneDauz`ere- P´er`es Modeling approaches to sequence dependent setups in lotsizing and scheduling Luis Guimar˜aes, Diego Klabjan and Bernardo Almada-Lobo 12:50-13:50 Lunch 13:50-15:10 Complexity results for the single item uncapacitated lot-sizing problem with time-dependent batch sizes Ayse Akbalik and Christophe Rapine Lot-sizing with minimum batch sizes Mathijn J. Retel Helmrich, Wilco van den Heuvel, Raf Jans and Albert P.M. Wagelmans 15:30-16:30 Social event 17:00-18:00 Drinks 18:30-21:30 Conference dinner ix Time Wednesday 29 August 9:00-9:30 Discussion: Next meeting 9:30-10:50 Dynamic capacitated lot-sizing with parallel common setup operators Karina Copil and Horst Tempelmeier First Results on Multi-Level Capacitated Lot-Sizing in Closed-Loop Sup- ply Chains Florian Sahling and Kristina Burmeister 10:50-11:20 Coffee Break 11:20-12:40 Linear programming models for the stochastic dynamic capacitated lot sizing problem Timo Hilger and Horst Tempelmeier Static-Dynamic Uncertainty Strategy for a Single-Item Stochastic Inven- tory Control Problem Ula¸s Ozen¨ , Mustafa K. Dogrun˘ and S. Armagan Tarim 12:40-13:40 Lunch 13:40-15:00 Effective Network Models for the Two-Level Serial Lot Sizing Problems Meltem Denizel, O˘guzSolyalı and Haldun Sural¨ A Single Phase Dynamic Program with Independent Production Deci- sion for Production-Capacitated Two- and Multi-Stage Lot-Sizing Prob- lems Hark-Chin Hwang, Hyun-soo Ahn and Philip Kaminsky 15:00-15:30 Coffee Break 15:30-16:50 The Single-Item Green Lot-Sizing Problem with Fixed Carbon Emissions Nabil Absi, Stephane´ Dauzere-P` er´ es,` Safia Kedad-Sidhoum and Bernard Penz Bi-objective Economic Lot-Sizing models Edwin Romeijn, Dolores Romero Morales and Wilco van den Heuvel 16:50-17:50 Drinks x Foreword At Erasmus University Rotterdam, we are very pleased to welcome you to the 3rd Inter- national Workshop on Lot-Sizing. The workshop has been organised after the excellent examples set by the Ecole Nationale Superieure´ des Mines de Saint-Etienne in Gardanne, France (2010), and Ozye¨ gin˘ University in Istanbul, Turkey (2011). The goal of the workshop is to cover recent advances in lot-sizing in order to facil- itate the exchange of research ideas, promote collaboration among researchers from all over the world, and contribute to the further development of the field. With more than 20 presentations, the workshop programme shows that lot-sizing is indeed an active and diverse research area. With more than 40 participants, these presentations will unques- tionably generate interesting discussions and stimulate new research ideas. I would like to thank Wilco van den Heuvel who, with the assistance of Mathijn Retel Helmrich and Ursula David, did most of the organisational work for this workshop. We would also like to acknowledge the financial support by ERIM, the Tinbergen Institute and the Econometric Institute.
Recommended publications
  • Econometric Institute News 2013 -1

    Econometric Institute News 2013 -1

    Econometric Institute News 2013 -1 Personnel Twan Dollevoet was appointed assistant professor in the Management Science section on January 1. His office is in room H11-10; ext. 81257. Viorel Milea was appointed assistant professor in the Logistics & Informatics section on January 1. His office is in room H11-21; ext. 82588. Willem van Jaarsveld was appointed assistant professor in the Logistics section on June 1. His office is in room H11-10; ext. 81257. Gönül Karaarslan joined the Econometric Institute as assistant professor in Logistics as from June 1. Her office is in room H10-23; ext. 88756. As from September 1: room H11-05; ext. 81342. Bart van Riessen joined the Logistics section as research assistant on June 1. His office is in room H10-15; ext. 81343. Liesbeth Noordegraaf-Eelens will leave the Econometric Institute on September 1, to become Head of the Department of Humanities of Erasmus University College. Nalan Basturk’s appointment as assistant professor has been extended from October 1, 2013 till October 1, 2014. Wendun Wang will join the Marketing section as trainee assistant professor on September 1, followed by a position as assistant professor on December 1. His office is in room H10-23; ext. 88756. Wilco van den Heuvel was appointed associate professor in Management Science on July 1. Remy Spliet will be appointed assistant professor in the Management Science section on November 1. His office is in room H11-5; ext. 81342. PhD Students Sander Barendse September 1: TI PhD student on the project “Rethinking risk when finance and macro meet”, supervised by Michael McAleer and Erik Kole.
  • ON the P-COVERAGE PROBLEM on the REAL LINE Stan Van

    ON the P-COVERAGE PROBLEM on the REAL LINE Stan Van

    ON THE P-COVERAGE PROBLEM ON THE REAL LINE Stan Van Hoesel and Albert Wagelmans OR 255-91 June 1991 ON THE P-COVERAGE PROBLEM ON THE REAL LINE Stan Van Hoesel 1 Albert Wagelmans 2 June 1991 Abstract: In this paper we consider the p-coverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. Then we analyze how the structure of the optimal solution changes if the setup costs of the facilities are all decreased by the same amount. This result is used to develop a parametric approach to the p-coverage problem which runs in O(pnlogn) time, n being the number of clients. OR/MS subject classification: Analysis of algorithms, computational complexity: parametric application of dynamic programming; Dynamic programming/optimal control, applications: parametric approach to p-coverage problem on the real line; Facilities/equipment planning, location, discrete: p-coverage problem on the real line Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. 2 Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands; currently on leave at the Operations Research Center, Massachusetts Institute of Technology, Cambridge MA; financial support of the Netherlands Organization for Scientific Research (NWO) is gratefully acknowledged. O. Introduction In Hassin and Tamir (1990) recent results in dynamic programming are used to improve the complexity bounds of several median and coverage location models on the real line.
  • Sensitivity Analysis of the Economic Lot-Sizing Problem

    Sensitivity Analysis of the Economic Lot-Sizing Problem

    SENSITIVITY ANALYSIS OF THE ECONOMIC LOT-SIZING PROBLEM Stan Van Hoesel and Albert Wagelmans OR 238-90 November 1990 SENSITIVITY ANALYSIS OF THE ECONOMIC LOT-SIZING PROBLEM Stan Van Hoesell '2 Albert Wagelmans1' 3 November 1990 Abstract In this paper we study sensitivity analysis of the uncapacitated single level economic lot-sizing problem, which was introduced by Wagner and Whitin about thirty years ago. In particular we are concerned with the computation of the maximal ranges in which the numerical problem parameters may vary individually, such that a solution already obtained remains optimal. Only recently it was discovered that faster algorithms than the Wagner-Whitin algorithm exist to solve the economic lot-sizing problem. Moreover, these algorithms reveal that the problem has more structure than was recognized so far. When performing the sensitivity analysis we exploit these newly obtained insights. Keywords: economic lot-sizing, sensitivity analysis 1) Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands 2) Supported by the Netherlands Organization for Scientific Research (NWO) under grant no. 611-304-017 3) On leave at the Operations Research Center, Room E 40-164, Massachusetts Institute of Technology, Cambridge, MA 02139; financial support of the Netherlands Organization for Scientific Research (NWO) is gratefully acknowledged. 1 Introduction In 1958 Wagner and Whitin published their seminal paper on the "Dynamic Version of the Economic Lot Size Model", in which they proposed a dynamic programming algorithm that solves the problem considered in O(n2 ) time, n being the length of the planning horizon. It is well-known that the same approach also solves a slightly more general problem to which we will refer as the economic lot-sizing problem (ELS).
  • Using Geometric Techniques to Improve Dynamic Programming Algorithms for the Economic Lot-Sizing Problem and Extensions

    Using Geometric Techniques to Improve Dynamic Programming Algorithms for the Economic Lot-Sizing Problem and Extensions

    Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions Citation for published version (APA): Wagelmans, A. P. M., Moerman, B., & Hoesel, van, C. P. M. (1992). Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. (Memorandum COSOR; Vol. 9245). Technische Universiteit Eindhoven. Document status and date: Published: 01/01/1992 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the 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.
  • On Setup Cost Reduction in the Economic Lot-Sizing Model Without Speculative Motives

    On Setup Cost Reduction in the Economic Lot-Sizing Model Without Speculative Motives

    ON SETUP COST REDUCTION IN THE ECONOMIC LOT-SIZING MODEL WITHOUT SPECULATIVE MOTIVES Stan Van Hoesel and Albert Wagelmans OR 256-91 August 1991 ON SETUP COST REDUCTION IN THE ECONOMIC LOT-SIZING MODEL WITHOUT SPECULATIVE MOTIVES Stan Van Hoesell Albert Wagelmans2 August 1991 Abstract An important special case of the economic lot-sizing problem is the one in which there are no speculative motives to hold inventory, i.e., the marginal cost of producing one unit in some period plus the cost of holding it until some future period is at least the marginal production cost in the latter period. It is already known that this special case can be solved in linear time. In this paper we study the effects of reducing all setup costs by the same amount. It turns out that the optimal solution changes in a very structured way. This fact will be used to develop faster algorithms for several problems that can be reformulated as parametric lot-sizing problems. One result, worth a sepparate mention, is an algorithm for the so-called dyna-mic lot-.sizing proble-m with learning effects in setups. This algorithm has a complexity that is of the same order as the fastest algorithm known so far, but it is valid for a more general class of models than usually considered. OR/MS subject classification: Analysis of algorithms, computational complexity: parametric economic lot-sizing problem; Dynamic programming /optimal control, applications: parametric economic lot-sizing problem; Inventory/)production, planning horizon: setup cost reduction in economic lot-sizing molel 1) Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.
  • A Dual Algorithm for the Economic Lot-Sizing Problem

    A Dual Algorithm for the Economic Lot-Sizing Problem

    European Journal of Operational Research 52 (1991) 315-325 315 North-Holland Theory and Methodology A dual algorithm for the economic lot-sizing problem Stan van Hoesel * and Albert Wagelmans Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, Netherlands Antoon Kolen University of Limburg, P.O. Box 616, 6200 MD Maastricht, Netherlands Received June 1989: revised December 1989 Abstract: A linear description for the economic lot-sizing problem consisting of exponentially many linear inequalities was given by Barany, Van Roy and Wolsey in 1984. Using this formulation we present a dual algorithm for the economic lot-sizing problem, which is of the same complexity as the Wagner and Whitin dynamic programming algorithm. Besides its use in sensitivity analysis the dual algorithm also provides an alternative proof of the fact that the linear description is complete. Keywords: Inventory, planning, linear programming, economic lot-sizing 1. Introduction We consider a manufacturer who needs to meet the known demands for a given product over a finite discrete planning horizon. In lot-sizing problems we have to decide when, i.e., in which time periods, and how much to produce so as to minimize total costs consisting of production and inventory costs. The inventory costs are linear in the number of items in stock at the end of each time period. The production costs decompose into two parts: a fixed set-up cost is incurred whenever a non-zero production occurs in a period in addition to a cost linear in the number of items produced. Producing in large (small) lots will decrease (increase) the set-up costs but will increase (decrease) the inventory costs.
  • Curriculum Vitae

    Curriculum Vitae

    Curriculum Vitae ALBERT PETER MARIE WAGELMANS Current position Professor of Management Science Erasmus University Rotterdam Date of birth: November 19, 1960 Place of birth: Rotterdam, the Netherlands Nationality: Dutch Marital status: married to Kerry M. Malone Children: Rory and Kyran Malone Address information Econometric Institute Tinbergen Building H3-11 Erasmus School of Economics Erasmus University Rotterdam PO Box 1738 3000 DR Rotterdam The Netherlands tel: +31 10 408 2576 fax: +31 10 408 9162 email: [email protected] homepage: http://www.erim.eur.nl/people/albert-wagelmans Education 1990: PhD degree, Erasmus University Rotterdam, Rotterdam, The Netherlands 1990: Diploma, European Doctoral Program in Quantitative Methods in Management 1985: Master's degree (doctoraal examen) in Econometrics (specialization in Operations Research), Erasmus School of Economics Professional experience (at Erasmus School of Economics, unless stated otherwise) 2006-2014: Director of the Econometric Institute 2005-present: Professor of Management Science 2001-2005: Professor of Operations Research, endowed chair on Applications in Transportation and Logistics 2001-2006: Director of the Bachelor-Master Program in Econometrics & Management Science; since 2005 also director of the Bachelor-Master Program in Informatics & Economics 2000-2001: Associate Professor of Operations Research 1999-2003: Associate Director of the Erasmus Research Institute of Management (ERIM) 1999-2002: Director of the Rotterdam Institute for Business Economic Studies
  • Annual Report 2003

    Annual Report 2003

    Annual Report 2003 Econometric Institute Annual Report 2003 Econometric Institute Erasmus University Rotterdam www.econometric-institute.com °c 2003, Econometric Institute All rights reserved. No part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage and retrieval system, without permission in writing from the author. A This report was prepared with LTEX2" Annual Report 2003 Econometric Institute Visit Mail Erasmus University Rotterdam Erasmus University Rotterdam Burg. Oudlaan 50 P.O. Box 1738 3062 PA Rotterdam 3000 DR Rotterdam The Netherlands The Netherlands Telephone & Fax phone: +31 10 408 1278 fax: +31 10 408 9162 Internet & E-mail www.econometric-institute.com [email protected] Preface It is often heard that the world around us is changing rapidly. New technologies, new institutions, and new policies; they all a®ect our day-to-day life. And, somewhat closer to us, new teaching methods, new academic programs (like bachelor and master), and new academic governance structures; they all a®ect our working conditions, also here at the Econometric Institute. Of course, the Econometric Institute, being on its way to its 50-th anniversary in 2006, has witnessed many turbulent developments in the last half a century. It is therefore prepared for facing many more. Indeed, its basics are solid and constant. There is a steady enrollment of ¯rst year undergraduates, a steady outflow of excellent students into graduate programs, and top-level academic research by its members, and last but not least, a comradely atmosphere.