Scheduling aircraft landings - the static case

This is the publisher version of the article, obtained from the link below.In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and that separation criteria between the landing of a plane and the landing of all successive planes are respected. We present a mixed-integer zero–one formulation of the problem for the single runway case and extend it to the multiple runway case. We strengthen the linear programming relaxations of these formulations by introducing additional constraints. Throughout, we discuss how our formulations can be used to model a number of issues (choice of objective function, precedence restrictions, restricting the number of landings in a given time period, runway workload balancing) commonly encountered in practice. The problem is solved optimally using linear programming-based tree search. We also present an effective heuristic algorithm for the problem. Computational results for both the heuristic and the optimal algorithm are presented for a number of test problems involving up to 50 planes and four runways.J.E.Beasley. would like to acknowledge the financial support of the Commonwealth Scientific and Industrial Research Organization, Australia

Optimisation of vendor-managed inventory systems

Imperial Users onl

Dynamic approach to solve the daily drayage problem with travel time uncertainty

The intermodal transport chain can become more e cient by means of a good organization of drayage movements. Drayage in intermodal container terminals involves the pick up and delivery of containers at customer locations, and the main objective is normally the assignment of transportation tasks to the di erent vehicles, often with the presence of time windows. This scheduling has traditionally been done once a day and, under these conditions, any unexpected event could cause timetable delays. We propose to use the real-time knowledge about vehicle position to solve this problem, which permanently allows the planner to reassign tasks in case the problem conditions change. This exact knowledge of the position of the vehicles is possible using a geographic positioning system by satellite (GPS, Galileo, Glonass), and the results show that this additional data can be used to dynamically improve the solution

Application of Reinforcement Learning to Multi-Agent Production Scheduling

Reinforcement learning (RL) has received attention in recent years from agent-based researchers because it can be applied to problems where autonomous agents learn to select proper actions for achieving their goals based on interactions with their environment. Each time an agent performs an action, the environment¡Šs response, as indicated by its new state, is used by the agent to reward or penalize its action. The agent¡Šs goal is to maximize the total amount of reward it receives over the long run. Although there have been several successful examples demonstrating the usefulness of RL, its application to manufacturing systems has not been fully explored. The objective of this research is to develop a set of guidelines for applying the Q-learning algorithm to enable an individual agent to develop a decision making policy for use in agent-based production scheduling applications such as dispatching rule selection and job routing. For the dispatching rule selection problem, a single machine agent employs the Q-learning algorithm to develop a decision-making policy on selecting the appropriate dispatching rule from among three given dispatching rules. In the job routing problem, a simulated job shop system is used for examining the implementation of the Q-learning algorithm for use by job agents when making routing decisions in such an environment. Two factorial experiment designs for studying the settings used to apply Q-learning to the single machine dispatching rule selection problem and the job routing problem are carried out. This study not only investigates the main effects of this Q-learning application but also provides recommendations for factor settings and useful guidelines for future applications of Q-learning to agent-based production scheduling

09261 Abstracts Collection -- Models and Algorithms for Optimization in Logistics

From June 21 to June 26, 2009 the Dagstuhl Seminar Perspectives Workshop 09261 ``Models and Algorithms for Optimization in Logistics \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Port Rail Shunting Optimization Problems

openThe work focuses on a particular section of the intermodal chain of freight transportation, which is the link between rail and sea transportation modes and happens in the maritime port area. Among this field, the study deals with the management of rail operations, called here rail shunting operations, that have to be performed in the port area. Two optimization problems arises in this context. The first concerns the scheduling of the rail shunting operations, here called Port Rail Shunting Scheduling Problem (PRSSP). The second deals with the re-scheduling of the same operations in case of unpredictable events, here called Port Rail Shunting Re-Scheduling Problem (PRSRP). After a literature overview on the concerning studies, we concentrate on an innovative way to use the well known space-time networks as solution approach structure for both the above mentioned problems. The innovative structure has been called operation-time-space network and is deeply analyzed in a dedicated chapter. A network flow model based on an operation-time-space network for solving PRSSP has been developed. It has been tested using random generated instances providing good results. The same model has been extended in order to solve PRSRP and it has been tested giving good results as well. Finally, the models have been used to solve the real case of a port area located in Italy in order to test the applicability of the developed models to a real context. The tests have been executed using real data and provided good results confirming the possibility to apply the proposed approach in similar real problems.openXXXIII CICLO - LOGISTICA E TRASPORTIAsta, Veronic

반도체 공장 내 일시적인 생산 용량 확장 정책 제안

학위논문 (석사) -- 서울대학교 대학원 : 공과대학 산업공학과, 2021. 2. 박건수.Due to the instability of the capacity of the semiconductor process, there are cases in which the production capacity temporarily becomes insufficient compared to the capacity allocated by the initial plan. To respond, production managers require capacity to other lines with compatible equipment. This decision can have an adverse effect on the entire line because the processes are connected in a sequence. In particular, it becomes more problematic when the machine group is a bottleneck process group. Therefore, this study proposes a capacity expansion policy learned by reinforcement learning algorithms in this environment using a FAB simulator built upon a WIP balancing scheduler and a machine disruption model. These policies performed better than policies imitating human decision in terms of throughput and machine efficiency.반도체공장은 설비 용량의 불안정성 때문에 초기 계획하여 할당된 설비 용량에 비해 일시적으로 생산 용량이 부족해지는 경우가 발생한다. 이를 대응하기 위해 생산 담당자들은 다른 라인에 호환가능한 설비를 공유하는 것을 요청하는데, 가능한 많은 양의 WIP에 대한 요청을 한다. 이러한 의사결정은 공정이 순차적으로 연결된 점 때문에 라인 전체 측면에서는 오히려 WIP Balancing을 악화시킬 수 있다. 특히 해당 공정군이 병목공정군인 경우 더 문제가 된다. 따라서 본 연구에서는 병목공정군을 중심으로 한 WIP Balancing scheduler를 이용하여 FAB simulator를 만든 뒤 이러한 환경속에서 강화학습 알고리즘으로 학습한 생산 용량 확장 정책을 제안한다. 이러한 정책은 throughput, machine efficiency 측면에서 사람의 의사결정을 모방한 정책보다 좋은 성과를 보였다.Abstract i Contents ii List of Tables iv List of Figures v Chapter 1 Introduction 1 1.1 Problem Description 3 1.2 Research Motivation and Contribution 5 1.3 Organization of the Thesis 5 Chapter 2 Literature Review 6 2.1 Review on FAB scheduling 6 2.2 Review on Dynamic production control 7 Chapter 3 Proposed Approach and Methodology 8 3.1 Proposed Approach 8 3.2 FAB Simulator 17 3.3 Reinforcement Learning Approach 26 Chapter 4 Computational Experiments 30 4.1 Experiment settings 30 4.2 Test Instances 31 4.3 Test Results 33 Chapter 5 Conclusions 37 Bibliography 38 국문초록 39Maste

An Optimistic Planning Approach for the Aircraft Landing Problem

International audienceThe Aircraft Landing Problem consists in sequencing aircraft on the available runways and scheduling their landing times taking into consideration several operational constraints, in order to increase the runway capacity and/or to reduce delays.In this work we propose a new Mixed Integer Programming (MIP) model for sequencing and scheduling aircraft landings on a single or multiple independent runways incorporating safety constraints by means of separation between aircraft at runways threshold. Due to the NP-hardness of the problem, solving directly the MIP model for large realistic instances yields redhibitory computation times. Therefore, we introduce a novel heuristic search methodology based on Optimistic Planning that significantly improve the FCFS (First-Come First-Served) solution, and provides good-quality solutions inreasonable computational time. The solution approach is then tested on medium and large realistic instances generated from real-world traffic on Paris-Orly airport to show the benefit of our approach