1 February 2007 in Transportation Science
Although London Heathrow is one of the busiest airports in the world, it has only one runway for use by departing aircraft at any time. Separations are required between each pair of aircraft at take-off—depending on their routes, weights, and speeds—to ensure safety. Efficient scheduling of the aircraft for take-off can reduce the total separations and increase throughput. A runway controller is responsible for take-off scheduling. This is a very intensive job with responsibility for all communication with aircraft and continuous monitoring to assure safety. The high workload limits the number of aircraft that the controller can take account of when scheduling. The geometry of the runway holding points adds physical constraints to the reordering of aircraft that are usually ignored in the academic literature. We present models for evaluating a schedule and determining the effects of the physical constraints. We propose a hybrid metaheuristic system that takes account of more aircraft than a human controller can handle, and so can aid the runway controller by recommending schedules that anticipate some future problems. We present results to show the effectiveness of this system, and we evaluate those results against real-world schedules.
16 October 2018 in International Journal of Production Research
With most Additive Manufacturing (AM) technology variants, build processes take place inside an internal enclosed build container, referred to as a ‘build volume’. It has been demonstrated that the effectiveness with which this volume is filled with product geometries forms an important determinant of overall process efficiency in AM. For effective operations management, it is important to understand not only the problem faced, but also which methods have proved effective (or ineffective) for problems with these characteristics in the past. This research aims to facilitate this increased understanding. The build volume packing task can be formulated as a three-dimensional irregular packing (3DIP) problem, which is a combinatorial optimisation problem requiring the configuration of a set of arbitrary volumetric items. This paper reviews existing general cutting and packing taxonomies and provides a new specification which is more appropriate for classifying the problems encountered in AM. This comprises a clear-cut problem definition, a set of precise categorisation criteria for objectives and problem instances, and a simple notation. Furthermore, the paper establishes an improved terminology with terms that are familiar to, but not limited to, researchers and practitioners in the field of AM. Finally, this paper describes a new dataset to be used in the evaluation of existing and proposed computational solution methods for 3DIP problems encountered in AM and discusses the importance of this research for further underpinning work.
9 April 2013 in Journal of Scheduling
1 September 2013 in Journal of the Operational Research Society
13 May 2008 in Journal of Scheduling
13 February 2013 in Public Transport