Downloaded from orbit.dtu.dk on: Oct 05, 2021 The Vessel Schedule Recovery Problem Disruption management in liner shipping Brouer, Berit Dangaard; Plum, Christian Edinger Munk; Vaaben, Bo; Pisinger, David; Dirksen, Jakob Publication date: 2012 Link back to DTU Orbit Citation (APA): Brouer, B. D., Plum, C. E. M., Vaaben, B., Pisinger, D., & Dirksen, J. (2012). The Vessel Schedule Recovery Problem: Disruption management in liner shipping. Abstract from 25th European Conference on Operations Research, Vilnius, Lithuania. 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 you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. TECHNICAL SESSIONS model and give an algorithm for scheduling multilayer divisible com- Monday, 8:30-10:00 putations. The algorithm is tested experimentally. Structures of the obtained schedules and performance of such applications are studied. MA-01 2 - Scheduling malleable tasks with arbitrary processing Monday, 8:30-10:00 speed functions RB-Alfa Maciej Machowiak, Poznan University of Technology, Poland, [email protected], Mikhail Y. Keynote Lecture: Professor Ignacio Kovalyov, Jan Weglarz, Maksim Barketau Grossmann The problem of scheduling n tasks in a system with m processors to minimize the makespan is considered. Task are malleable when can be Stream: Keynote, Tutorial and Plenary Lectures executed by several processors at a time, its processing speed depends Keynote session on the number of assigned processors, and a set of processors assigned Chair: Vincent Mousseau, LGI, Ecole Centrale Paris, Grande voie to the same task can change over time. The processing speed of a task des vignes, 92 295, Chatenay Malabry, France, is a strictly increasing function of the number of processors allocated to this task. We present results for arbitrary n and m: polynomial time [email protected] algorithms for convex and concave functions and an enumerative algo- rithm for arbitrary functions. 1 - Challenges in the Application of Mathematical Pro- gramming in the Enterprise-wide Optimization of 3 - Fast Truck-Packing of 3D boxes Process Industries Grzegorz Pawlak, Institute of Computing Science, Poznan Ignacio Grossmann, Chemical Engineering, Carnegie Mellon University of Technology, ul. Piotrowo 2, 60-965, Poznan, University, 5000 Forbes Ave, 15217, Pittsburgh, PA, United Poland, [email protected], Joanna States, [email protected] Jozefowska, Erwin Pesch, Dawid Kowalski, Michal Morze Enterprise-wide optimization (EWO) is a new emerging area that lies The practical 3D container packing problem was considered. The at the interface of chemical engineering and operations research, and problem was formulated for the real packing constrains appearing in has become a major goal in the process industries due to the increasing the sales and logistics departments of household equipment factory. pressures for remaining competitive in the global marketplace. EWO The formal MIP formulation has been presented and fast heuristic al- involves optimizing the operations of supply, production and distribu- gorithm was proposed. The appropriate computational experiment has tion activities of a company to reduce costs and inventories. A major been performed. The solution can be implemented in the real container focus in EWO is the optimization of manufacturing plants as part of the packing problem for the rectangular boxed products. overall optimization of the supply chain. Major operational items in- clude production planning, scheduling, and control. This talk provides 4 - Genetic Algorithm Supporting Supply Process in an overview of major modeling and computational challenges in the Charitable Organizations development of deterministic and stochastic linear/nonlinear mixed- Malgorzata Sterna, Institute of Computing Science, Poznan integer optimization models for planning and scheduling for the opti- University of Technology, Piotrowo 2, 60-965, Poznan, mization of plants and entire supply chains that are involved in EWO problems. We illustrate the application of these ideas in four major Poland, [email protected], Mateusz problems: a) integration of planning and scheduling in batch processes Cichenski, Mateusz Jarus, Michal Miskiewicz, Jaroslaw that lead to large-scale mixed-integer linear programs, b) optimization Szymczak of responsive process supply chains that lead to large-scale bicriterion mixed-integer optimization problems, c) optimization of distribution- We study the optimization problem arising in charitable organizations inventory planning of industrial gases that lead to integration of plan- during supply process. Such institutions are especially interested in ning and vehicle-routing models, d) optimization of oilfield infrastruc- minimizing the total cost of purchase which consists of the prices at tures under uncertainty that lead to multistage stochastic programming which particular products are bought and the cost of their transporta- problems with endogenous uncertain parameters. We outline the so- tion. We present the formal mathematical model of the problem, which lution methods that have been developed. Also, these problems have is NP-hard, and propose list heuristics as well as the genetic algorithm been addressed in collaboration with industry, and have led to substan- solving it. The efficiency of implemented methods was checked in tial economic savings. extensive computational experiments. MA-02 MA-03 Monday, 8:30-10:00 Monday, 8:30-10:00 RB-Beta RB-L1 Scheduling Applications Business Excellence in Logistics: Intelligent and Interactive Routing Stream: Scheduling Invited session Stream: Business Excellence in Logistics Chair: Malgorzata Sterna, Institute of Computing Science, Poznan Invited session University of Technology, Piotrowo 2, 60-965, Poznan, Poland, Chair: Martin Josef Geiger, Logistics Management Department, [email protected] Helmut-Schmidt-University, Holstenhofweg 85, 22041, Hamburg, Germany, [email protected] 1 - Scheduling chains of divisible computations Chair: Murat Koksalan, [email protected] Maciej Drozdowski, Dept. of Computer Science, Institute of Computing Science, Poznan Univeristy of Technology, 1 - An Interactive Approach for Multi-objective Route Se- Piotrowo 2, 60-965, Poznan, Poland, lection Problem [email protected], Joanna Berlinska Diclehan Tezcaner, Industrial Engineering, Middle East We analyze scheduling chains of divisible computations. In the chain, Technical University, Endustri Muhendisligi Bolumu, Orta one application produces input load for the next one. MapReduce ap- Dogu Teknik Universitesi, 06800, Ankara, Turkey, plications are example of 2-stage chains. We propose a divisible load [email protected], Murat Koksalan 1 MA-04 EURO 25 - Vilnius 2012 Multi-objective (MO) route selection problem is a combination of two Previous research has proposed using a mixed integer programming combinatorial problems: MO shortest path problem (finding the effi- (MIP) model for choosing the location of stations in one-way carshar- cient paths between the nodes to be visited) and MO traveling salesper- ing systems as an approach to solve vehicle stock imbalance. However, son problem (finding the efficient tours made up of the efficient paths). MIP models have difficulties including reality-based factors that can We develop an interactive approach that helps in finding the best solu- have a substantial impact on carsharing. Thus we test the validity of tion of a decision maker who has a quasiconcave utility function. We those solutions developing a simulation model including demand vari- demonstrate our approach on the routing problem for unmanned air ability and relocation operations. The first tentative results show that vehicles with minimization of distance traveled and minimization of these factors influence the company profit, affecting significantly the radar detection threat objectives. performance of the deterministic solutions. 2 - Delivery Scheduling Using Intelligence 3 - Assessing the profitability of carsharing fleet distri- Gulgun Kayakutlu, Industrial Engineering, Istanbul Technical butions based on usage patterns University, Macka, 34367, Istanbul, Turkey, Mathias Goeppel, GR/PAP, Daimler AG, Building 10, Room [email protected], Gokcen Turkel 2.3.036, Wilhelm-Runge-Str. 11, 89081, Ulm, Germany, Dynamic scheduling is an indispensable need in today’s business [email protected] world.To satisfy the customer,on-time delivery is crucial for the business to continue in spite of continuous change.This study aims One-way carsharing as seen with car2go, where vehicle pick-up and to propose a model to predict the optimum time of van deliver- drop-off locations are not predefined, challenges the operator. The pre- ies.Factors influencing the delivery process are depicted from vari- dominant difficulty lies in matching