A Hierarchical Temporal Planning-Based Approach for Dynamic Hoist Scheduling Problems

Hoist scheduling has become a bottleneck in electroplating industry applications with the development of autonomous devices. Although there are a few approaches proposed to target at the challenging problem, they generally cannot scale to large-scale scheduling problems. In this paper, we formulate the hoist scheduling problem as a new temporal planning problem in the form of adapted PDDL, and propose a novel hierarchical temporal planning approach to efficiently solve the scheduling problem. Additionally, we provide a collection of real-life benchmark instances that can be used to evaluate solution methods for the problem. We exhibit that the proposed approach is able to efficiently find solutions of high quality for large-scale real-life benchmark instances, with comparison to state-of-the-art baselines

Novel approaches to cyclic job-shop problems with transportation

Scheduling problems can be found in almost any field of application in the real world. These problems may not only have different characteristics but they also imply more or less complex requirements. One specific class within this domain is the cyclic job-shop problem. It occurs in various areas reaching from industrial production planning down to the systems architecture of computers. With manufacturers in particular, one can find increasing demand for effective solution methods in order to tackle these scheduling problems efficiently. This thesis will deal with the Cyclic Job-Shop Problem with Blocking and Transportation. It arises in modern manufacturing companies, where the products move automatically between the different workstations, for instance. The problem itself is not new to the research community, but hardly any work has been done in solving it. Within this thesis we will try to close this gap and present some first approaches, discussing the structure of the problem and how it can be solved. As a result, we will provide three different solution methods, including an integer programming formulation, which is solved with a commercial solver, a branch and bound algorithm and a tabu search heuristic. All algorithms are tested on a range of data sets and compared with each other. Additionally, we have worked on a polynomial solvable subproblem, which has gained more interest in the literature. As a result, a new polynomial algorithm, that outperforms the existing ones in theory as well as in empirical tests (except for some special cases) is presented. This thesis concludes with a discussion about ideas of how to improve the presented methods and some other extensions to the investigated problem

A product mix and a material flow problem concerning the semiconductor manufacturing industry

Das zentrale Thema dieser Arbeit behandelt die Optimierung der Programm- und Ablaufplanung in der Halbleiterindustrie. Die Diplomarbeit besteht aus zwei separaten Teilen. Der erste Abschnitt befasst sich mit einem Unternehmen aus dieser Branche namens Infineon Technologies AG. Dieser internationale Konzern dient als Beispiel für den theoretischen Hintergrund des Halbleiter-Fertigungsprozesses mit seinen spezifischen Anforderungen. Das zugrunde liegende Verfahren zeichnet sich durch große Anfälligkeit der Produkte während des Produktionsprozesses und enorme Komplexität aus. Da die gesamte Fertigung nicht als Ganzes betrachtet und optimiert werden kann, werden in der Diplomarbeit zwei unterschiedliche Problemstellungen angeführt: ein Produkt-Mix und ein Material-Flow-Problem. Dabei wird einerseits versucht, den Profit zu maximieren, andererseits soll die gesamte Herstellungszeit innerhalb einer Werkstatt minimiert werden. Diese beiden Sachverhalte werden zunächst theoretisch diskutiert und in weiterer Folge wird die mathematische Modellierung mit Xpress optimal gelöst. Das Produkt-Mix Teilproblem erfordert lediglich die Umsetzung in Xpress, da die generierten Ergebnisse Optimalität aufweisen und die Rechenzeit sich um 0 Sekunden in jedem Durchlauf bewegt. Daher wird kein weiterer Vergleich mit einer anderen Software-Implementierung dargestellt. Die generierten Lösungen des Materialfluss-Problems aus Xpress werden mit den heuristischen Ergebnissen anhand der Implementierung in C++ verglichen. Diese Ergebnisse erreichen die Optimalität nicht, sondern bieten eine gute und praktikable Lösung für eine größere Auswahl von Fällen in angemessener Rechenzeit

SIMAID: a rapid development methodology for the design of acyclic, bufferless, multi-process and mixed model agile production facilities for spaceframe vehicles

The facility layout problem (FL) is a non-linear, NP-complete problem whose complexity is derived from the vast solution space generated by multiple variables and interdependent factors. For reconfigurable, agile facilities the problem is compounded by parallelism (simultaneity of operations) and scheduling issues. Previous work has either concentrated on conventional (linear or branched) facility layout design, or has not considered the issues of agile, reconfigurable facilities and scheduling. This work is the first comprehensive methodology incorporating the design and scheduling of parallel cellular facilities for the purpose of easy and rapid reconfiguration in the increasingly demanding world of agile manufacturing. A novel three-stage algorithm is described for the design of acyclic (asynchronous), bufferless, parallel, multi-process and mixed-model production facilities for spaceframe-based vehicles. Data input begins with vehicle part processing and volume requirements from multiple models and includes time, budget and space constraints. The algorithm consists of a powerful combination of a guided cell formation stage, iterative solution improvement searches and design stage scheduling. The improvement iterations utilise a modified (rules-based) Tabu search applied to a constant-flow group technology, while the design stage scheduling is done by the use of genetic algorithms. The objective-based solution optimisation direction is not random but guided, based on measurement criteria from simulation. The end product is the selection and graphic presentation of the best solution out of a database of feasible ones. The case is presented in the form of an executable program and three real world industrial examples are included. The results provide evidence that good solutions can be found to this new type and size of heavily constrained problem within a reasonable amount of time

Operational Control of Internal Transport

Operational Control of Internal Transport considers the control of guided vehicles in vehicle-based internal transport systems found in facilities such as warehouses, production plants, distribution centers and transshipment terminals. The author's interest of research having direct use for practice has resulted in a combination of theoretical and practical research in vehicle-based internal transport systems. An overview is given of the related literature and results are presented that show how different vehicle dispatching rules behave in different environments

The impact of automation on the efficiency and cost effectiveness of the quayside and container yard cranes and the selection decision for the yard operating systems

This research evaluates the impact of automated and semi-automated devices on the process of loading, discharging, stacking and un-stacking of containers using Quayside Cranes (QSCs), Straddle Carriers (SCs), Rubber Tyred Gantry cranes (RTGs) and Rail Mounted Gantry cranes (RMGs) in container terminals. The emphasis of study is on the assessment of performance and cost effectiveness of the existing automated quayside and yard cranes. The study in this thesis examines the economic implications of reducing QSCs' cycle-times brought about by automatic features installed on the post-Panamax cranes. It demonstrates that a considerable increase in the productivity of QSCs is related directly or indirectly to an expected reduction of crane cycle-times. The concept offered by the proposed improvements distinguishes between the traditional system of loading and discharging of containers and the automated methods. It implies that automation devices installed on conventional QSCs significantly reduce the total turnaroundtime and hence the cost of containerships' waiting-times. It argues, however, that there should be a balance between the cost of containerships' waiting-times and the cost of automated berths' unproductive-times (idle-times). This study uses the elements of queuing theories and proposes a novel break-even method for calculating such a balance. The number of container Ground Slots (GSs) and the annual throughput of container terminals expressed in Twenty-foot Equivalent Units (TEUs) have been used as the efficiency and performance measure for many years. The study in this thesis introduces appropriate container yard design layouts and provides a generic model for calculating the annual throughput for container terminals using semiautomated SC and RTG and automated and semi-automated RMG operating systems. The throughput model proposed in this study incorporates the dynamic nature, size, type and capacity of the automated container yard operating systems and the average dwell-times, transhipment ratio, accessibility and stacking height of the containers as the salient factors in determining a container terminal throughput. Further, this thesis analyses the concept of cost functions for container yard operating systems proposed. It develops a generic cost-based model that provides the basis for a pair-wise comparison, analysis and evaluation of the economic efficiency and effectiveness of automated and semi-automated container yard stacking cranes and helps to make rational decisions. This study proposes a Multiple Attribute Decision-Making (MADM) method for evaluating and selecting the best container yard operating system amongst alternatives by examining the most important operating criteria involved. The MADM method proposed enables a decision-maker to study complex problems and allows consideration of qualitative and qualitative attributes that are heterogeneous in nature. An Analytical Hierarchy Process (AHP) technique has been employed as a weighting method to solve the MADM problem. The AHP allows for the decomposition of decision problem into a hierarchical order and enables a pair-wise comparison of the attributes and alternatives. The results of the AHP analysis provide the basis for a pair-wise comparison, judgement and selection of the best automated or semi-automated container yard operating system

Infrastructure Design, Signalling and Security in Railway

Railway transportation has become one of the main technological advances of our society. Since the first railway used to carry coal from a mine in Shropshire (England, 1600), a lot of efforts have been made to improve this transportation concept. One of its milestones was the invention and development of the steam locomotive, but commercial rail travels became practical two hundred years later. From these first attempts, railway infrastructures, signalling and security have evolved and become more complex than those performed in its earlier stages. This book will provide readers a comprehensive technical guide, covering these topics and presenting a brief overview of selected railway systems in the world. The objective of the book is to serve as a valuable reference for students, educators, scientists, faculty members, researchers, and engineers

Seventh Annual Workshop on Space Operations Applications and Research (SOAR 1993), volume 2

This document contains papers presented at the Space Operations, Applications and Research Symposium (SOAR) Symposium hosted by NASA/Johnson Space Center (JSC) and cosponsored by NASA/JSC and U.S. Air Force Materiel Command. SOAR included NASA and USAF programmatic overviews, plenary session, panel discussions, panel sessions, and exhibits. It invited technical papers in support of U.S. Army, U.S. Navy, Department of Energy, NASA, and USAF programs in the following areas: robotics and telepresence, automation and intelligent systems, human factors, life support, and space maintenance and servicing. SOAR was concerned with Government-sponsored research and development relevant to aerospace operations