Diagram of Lot 142 and Lot 186 showing the line of the road in red

Diagram of Lot 142 and Lot 186 showing the line of the road in red, Dec.10, 1856.

Planning and Scheduling Decisions in Supply Chains with Multiple Supply Modes: An Integrated Approach

We address the problem of jointly determining shipment planning and scheduling decisions with the presence of multiple shipment modes. We consider long lead time, less expensive sea shipment mode, and short lead time but expensive air shipment modes. Existing research on multiple shipment modes largely address the short term scheduling decisions only. Motivated by an industrial problem where planning decisions are independent of the scheduling decisions, we investigate the benefits of integrating the two sets of decisions. We develop sequence of mathematical models to address the planning and scheduling decisions. Preliminary computational results indicate improved performance of the integrated approach over some of the existing policies used in real-life situations.

Development of an internet supportive platform for online teaching and learning of construction planning and scheduling

Construction Planning and Scheduling is taught for the fIrst time ill Semester 2, 2004 in the School of Architecture and Building, Deakin University. During the unit development process and the implementation of teaching activities, several issues arose in relation to implementing computer-aided construction scheduling and unit delivery in a unitary environment. Although various types of construction planning and scheduling software have been developed and applied, none of them can be run inside an online teaching software package, which provides powerful functions in administration. This research aims to explore the strategies to connect a project planning and scheduling software package and an online ~aching and learning software package by a Web-based support platform so that both the lecturer and students can draw up and communicate a construction plan or schedule with tables and fIgures. The key techniques of this supportive platfonn are idt;nlifies and they include a web-based graphically user-interfaced, dynamic and distributed multimedia data acquisition mechanism, which accepts users' drawings and retrieval information from canvas and stores the multimedia data ona server for further usage. This paper demonstrates the techniques and principals needed to construct such a multimedia data acquisition tool. This. research will fill the gap.in the literature in respect to an online pedagogical solution to an existing problem.

Beyond Abrahamism : a fresh reading of the Tanakh traditions respecting Lot, Moab and Ammon

At the heart of this study is my interest in the way in which a religious community establishes its sense of identity and its boundaries in relation to other groups. I explore the case of Israel's attitude towards her eastern neighbours, the Moabites and Ammonites, as portrayed in Tanakh, the Hebrew Bible. Most commentary from the last one hundred years privileges one particular view of Moab and Ammon as traditional enemies of Israel. I aim to show the validity of readings of the biblical accounts that reveal a more complex relationship between Israel and her neighbours. Tanakh exhibits a dialectic between eirenic and hostile viewpoints. The stories of Abraham and Lot, who are presented as ancestors of Israel and of Moab and Ammon, to some degree represent Israel’s understanding of her neighbours. Conventional commentaries take for granted the accepted orthodoxy of Judaism, Christianity and Islam concerning Abraham and his significance in terms of faith and righteousness and blessing and covenant. As none of these notions is specifically linked to Lot at any point, he is treated as a pathetic figure and remains secondary in conventional commentary. Many commentaries denigrate the character of Lot, often in direct comparisons with Abraham. My reading of the texts of Genesis attempts to free the story of Lot from the constraints imposed by the way the story of Abraham functions. A careful reading of the Genesis account shows that Lot and Abraham exhibit similar elements of moral ambiguity, and Genesis contains no statement that condemns Lot on moral or religious grounds. Genesis 19, the single narrative in which Lot appears independently of Abraham, participates in the dialectic elsewhere in Tanakh. On the basis of a consistent pattern of action and speech throughout the first portion of Genesis 19, I advance my own original conception of the eirenic viewpoint of the narrator concerning Lot and his relationship to the divine. I attempt to demonstrate ways in which the story of Lot critiques or deconstructs the dominant ideology centred upon Abraham. My conception of the particular interests of the compiler of Genesis 19 is supported by several intertextual studies. These include the traditions of Sodom and of Zoar, the story of hospitality in Judges 19, the story of the deluge (Genesis 6-9) and stories of women who, like Lot’s daughters, act to continue the family line. In a treatment of the history of Lot traditions, I find evidence to separate the story of Lot from the work of the Yahwist. I consider whether the stories of Lot have a derivation east of the Jordan and whether the stories were of particular interest to the Deuteronomists. In the final chapter of this study, I focus on the main themes of the narratives concerning Lot and Abraham, and Moab and Ammon and Israel. The question of social boundaries arises in regard to many of these themes, such as the interaction of female and male, the role of wealth, the relation of city and country, kinship, and rights to land settlement. In this way, the treatment of Lot and Abraham in Tanakh and in subsequent traditions offers a perspective upon the formation of identity in the contemporary world of religious plurality.

A multi-level approach to planning and scheduling resources for aviation training

This paper describes a multi-level system dynamics (SD) / discrete event simulation (DES) approach for assessing planning and scheduling problems within an aviation training continuum. The aviation training continuum is a complex system, consisting of multiple aviation schools interacting through interschool student and instructor flows that are affected by external triggers such as resource availability and the weather.
SD was used to model the overall training continuum at a macro level to ascertain relationships between system entities. SD also assisted in developing a shared understanding of the training continuum, which involves constructing the definitions of the training requirements, resources and policy objectives. An end-to-end model of the continuum is easy to relate to, while dynamic visualisation of system behaviour provides a method for exploration of the model.
DES was used for micro level exploration of an individual school within the training continuum to capture the physical aspects of the system including resource capacity requirements, bottlenecks and student waiting times. It was also used to model stochastic events such as weather and student availability. DES has the advantage of being able to represent system variability and accurately reflect the limitations imposed on a system by resource constraints.
Through sharing results between the models, we demonstrate a multi-level approach to the analysis of the overall continuum. The SD model provides the school’s targeted demand to the DES model. The detailed DES model is able to assess schedules in the presence of resource constraints and variability and provide the expected capacity of a school to the high level SD model, subjected to constraints such as instructor availability or budgeted number of training systems. The SD model allows stakeholders to assess how policy and planning affect the continuum, both in the short and the long term.
The development of this approach permits moving the analysis of the continuum between SD and DES models as appropriate for given system entities, scales and tasks. The resultant model outcomes are propagated between the continuum and the detailed DES model, iteratively generating an assessment of the entire set of plans and schedule across the continuum. Combining data and information between SD and DES models and techniques assures relevance to the stakeholder needs and effective problem scoping and scaling that can also evolve with dynamic architecture and policy requirements.
An example case study shows the combined use of the two models and how they are used to evaluate a typical scenario where increased demand is placed on the training continuum. The multi-level approach provides a high level indication of training requirements to the model of the new training school, where the detailed model indicates the resources required to achieve those particular student levels.

Hybrid Methods for Resource Allocation and Scheduling Problems in Deterministic and Stochastic Environments

This work presents exact, hybrid algorithms for mixed resource Allocation and Scheduling problems; in general terms, those consist into assigning over time finite capacity resources to a set of precedence connected activities. The proposed methods have broad applicability, but are mainly motivated by applications in the field of Embedded System Design. In particular, high-performance embedded computing recently witnessed the shift from single CPU platforms with application-specific accelerators to programmable Multi Processor Systems-on-Chip (MPSoCs). Those allow higher flexibility, real time performance and low energy consumption, but the programmer must be able to effectively exploit the platform parallelism. This raises interest in the development of algorithmic techniques to be embedded in CAD tools; in particular, given a specific application and platform, the objective if to perform optimal allocation of hardware resources and to compute an execution schedule. On this regard, since embedded systems tend to run the same set of applications for their entire lifetime, off-line, exact optimization approaches are particularly appealing. Quite surprisingly, the use of exact algorithms has not been well investigated so far; this is in part motivated by the complexity of integrated allocation and scheduling, setting tough challenges for ``pure'' combinatorial methods. The use of hybrid CP/OR approaches presents the opportunity to exploit mutual advantages of different methods, while compensating for their weaknesses. In this work, we consider in first instance an Allocation and Scheduling problem over the Cell BE processor by Sony, IBM and Toshiba; we propose three different solution methods, leveraging decomposition, cut generation and heuristic guided search. Next, we face Allocation and Scheduling of so-called Conditional Task Graphs, explicitly accounting for branches with outcome not known at design time; we extend the CP scheduling framework to effectively deal with the introduced stochastic elements. Finally, we address Allocation and Scheduling with uncertain, bounded execution times, via conflict based tree search; we introduce a simple and flexible time model to take into account duration variability and provide an efficient conflict detection method. The proposed approaches achieve good results on practical size problem, thus demonstrating the use of exact approaches for system design is feasible. Furthermore, the developed techniques bring significant contributions to combinatorial optimization methods.

Constraint based methods for allocation and scheduling of periodic applications

This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assignment to a set of activities, to be indefinitely repeated, subject to precedence and resource capacity constraints. In this work we present two constraint programming frameworks facing two different types of cyclic problems. In first instance, we consider the disjunctive RA&CSP, where the allocation problem considers unary resources. Instances are described through the Synchronous Data-flow (SDF) Model of Computation. The key problem of finding a maximum-throughput allocation and scheduling of Synchronous Data-Flow graphs onto a multi-core architecture is NP-hard and has been traditionally solved by means of heuristic (incomplete) algorithms. We propose an exact (complete) algorithm for the computation of a maximum-throughput mapping of applications specified as SDFG onto multi-core architectures. Results show that the approach can handle realistic instances in terms of size and complexity. Next, we tackle the Cyclic Resource-Constrained Scheduling Problem (i.e. CRCSP). We propose a Constraint Programming approach based on modular arithmetic: in particular, we introduce a modular precedence constraint and a global cumulative constraint along with their filtering algorithms. Many traditional approaches to cyclic scheduling operate by fixing the period value and then solving a linear problem in a generate-and-test fashion. Conversely, our technique is based on a non-linear model and tackles the problem as a whole: the period value is inferred from the scheduling decisions. The proposed approaches have been tested on a number of non-trivial synthetic instances and on a set of realistic industrial instances achieving good results on practical size problem.

Observable stages and scheduling for alveolar remodeling following antemortem tooth loss

Zahnverlust zu Lebzeiten („antemortem tooth loss“, AMTL) kann als Folge von Zahnerkrankungen, Traumata, Zahnextraktionen oder extremer kontinuierlicher Eruption sowie als Begleiterscheinung fortgeschrittener Stadien von Skorbut oder Lepra auftreten. Nach dem Zahnverlust setzt die Wundheilung als Sekundärheilung ein, während der sich die Alveole mit Blut füllt und sich ein Koagulum bildet. Anschließend erfolgt dessen Umwandlung in Knochengewebe und schließlich verstreicht die Alveole derart, dass sie makroskopisch nicht mehr erkannt werden kann. Der Zeitrahmen der knöchernen Konsolidierung des Kieferkammes ist im Detail wenig erforscht. Aufgrund des gehäuften Auftretens von AMTL in menschlichen Populationen, ist die Erarbeitung eines Zeitfensters, mit dessen Hilfe durch makroskopische Beobachtung des Knochens die Zeitspanne seit dem Zahnverlust („time since tooth loss“, TSL) ermittelt werden kann, insbesondere im archäologischen Kontext äußerst wertvoll. Solch ein Zeitschema mit Angaben über die Variabilität der zeitlichen Abläufe bei den Heilungsvorgängen kann nicht nur in der Osteologie, sondern auch in der Forensik, der allgemeinen Zahnheilkunde und der Implantologie nutzbringend angewandt werden. rnrnNach dem Verlust eines Zahnes wird das Zahnfach in der Regel durch ein Koagulum aufgefüllt. Das sich bildende Gewebe wird rasch in noch unreifen Knochen umgewandelt, welcher den Kieferknochen und auch die angrenzenden Zähne stabilisiert. Nach seiner Ausreifung passt sich das Gewebe schließlich dem umgebenden Knochen an. Das Erscheinungsbild des Zahnfaches während dieses Vorgangs durchläuft verschiedene Stadien, welche in der vorliegenden Studie anhand von klinischen Röntgenaufnahmen rezenter Patienten sowie durch Untersuchungen an archäologischen Skelettserien identifiziert wurden. Die Heilungsvorgänge im Zahnfach können in eine prä-ossale Phase (innerhalb einer Woche nach Zahnverlust), eine Verknöcherungsphase (etwa 14 Wochen nach Zahnverlust) und eine ossifizierte bzw. komplett verheilte Phase (mindestens 29 Wochen nach Zahnverlust) eingeteilt werden. Etliche Faktoren – wie etwa die Resorption des Interdentalseptums, der Zustand des Alveolarknochens oder das Individualgeschlecht – können den normalen Heilungsprozess signifikant beschleunigen oder hemmen und so Unterschiede von bis zu 19 Wochen verursachen. Weitere Variablen wirkten sich nicht signifikant auf den zeitlichen Rahmen des Heilungsprozesse aus. Relevante Abhängigkeiten zwischen verschiedenen Variabeln wurden ungeachtet der Alveolenauffüllung ebenfalls getestet. Gruppen von unabhängigen Variabeln wurden im Hinblick auf Auffüllungsgrad und TSL in multivariablen Modellen untersucht. Mit Hilfe dieser Ergebnisse ist eine grobe Einschätzung der Zeitspanne nach einem Zahnverlust in Wochen möglich, wobei die Einbeziehung weiterer Parameter eine höhere Präzision ermöglicht. rnrnObwohl verschiedene dentale Pathologien in dieser Studie berücksichtigt wurden, sollten zukünftige Untersuchungen genauer auf deren potenzielle Einflussnahme auf den alveolaren Heilungsprozess eingehen. Der kausale Zusammenhang einiger Variablen (wie z. B. Anwesenheit von Nachbarzähnen oder zahnmedizinische Behandlungen), welche die Geschwindigkeit der Heilungsrate beeinflussen, wäre von Bedeutung für zukünftige Untersuchungen des oralen Knochengewebes. Klinische Vergleichsstudien an forensischen Serien mit bekannter TSL oder an einer sich am Anfang des Heilungsprozesses befindlichen klinischen Serie könnten eine Bekräftigung dieser Ergebnisse liefern.

Distributed allocation and scheduling of applications on HPC platforms

High Performance Computing e una tecnologia usata dai cluster computazionali per creare sistemi di elaborazione che sono in grado di fornire servizi molto piu potenti rispetto ai computer tradizionali. Di conseguenza la tecnologia HPC e diventata un fattore determinante nella competizione industriale e nella ricerca. I sistemi HPC continuano a crescere in termini di nodi e core. Le previsioni indicano che il numero dei nodi arrivera a un milione a breve. Questo tipo di architettura presenta anche dei costi molto alti in termini del consumo delle risorse, che diventano insostenibili per il mercato industriale. Un scheduler centralizzato non e in grado di gestire un numero di risorse cosi alto, mantenendo un tempo di risposta ragionevole. In questa tesi viene presentato un modello di scheduling distribuito che si basa sulla programmazione a vincoli e che modella il problema dello scheduling grazie a una serie di vincoli temporali e vincoli sulle risorse che devono essere soddisfatti. Lo scheduler cerca di ottimizzare le performance delle risorse e tende ad avvicinarsi a un profilo di consumo desiderato, considerato ottimale. Vengono analizzati vari modelli diversi e ognuno di questi viene testato in vari ambienti.

TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM

More than eighteen percent of the world’s population lives without reliable access to clean water, forced to walk long distances to get small amounts of contaminated surface water. Carrying heavy loads of water long distances and ingesting contaminated water can lead to long-term health problems and even death. These problems affect the most vulnerable populations, women, children, and the elderly, more than anyone else. Water access is one of the most pressing issues in development today. Boajibu, a small village in Sierra Leone, where the author served in Peace Corps for two years, lacks access to clean water. Construction of a water distribution system was halted when a civil war broke out in 1992 and has not been continued since. The community currently relies on hand-dug and borehole wells that can become dirty during the dry season, which forces people to drink contaminated water or to travel a far distance to collect clean water. This report is intended to provide a design the system as it was meant to be built. The water system design was completed based on the taps present, interviews with local community leaders, local surveying, and points taken with a GPS. The design is a gravity-fed branched water system, supplied by a natural spring on a hill adjacent to Boajibu. The system’s source is a natural spring on a hill above Boajibu, but the flow rate of the spring is unknown. There has to be enough flow from the spring over a 24-hour period to meet the demands of the users on a daily basis, or what is called providing continuous flow. If the spring has less than this amount of flow, the system must provide intermittent flow, flow that is restricted to a few hours a day. A minimum flow rate of 2.1 liters per second was found to be necessary to provide continuous flow to the users of Boajibu. If this flow is not met, intermittent flow can be provided to the users. In order to aid the construction of a distribution system in the absence of someone with formal engineering training, a table was created detailing water storage tank sizing based on possible source flow rates. A builder can interpolate using the source flow rate found to get the tank size from the table. However, any flow rate below 2.1 liters per second cannot be used in the table. In this case, the builder should size the tank such that it can take in the water that will be supplied overnight, as all the water will be drained during the day because the users will demand more than the spring can supply through the night. In the developing world, there is often a problem collecting enough money to fund large infrastructure projects, such as a water distribution system. Often there is only enough money to add only one or two loops to a water distribution system. It is helpful to know where these one or two loops can be most effectively placed in the system. Various possible loops were designated for the Boajibu water distribution system and the Adaptive Greedy Heuristic Loop Addition Selection Algorithm (AGHLASA) was used to rank the effectiveness of the possible loops to construct. Loop 1 which was furthest upstream was selected because it benefitted the most people for the least cost. While loops which were further downstream were found to be less effective because they would benefit fewer people. Further studies should be conducted on the water use habits of the people of Boajibu to more accurately predict the demands that will be placed on the system. Further population surveying should also be conducted to predict population change over time so that the appropriate capacity can be built into the system to accommodate future growth. The flow at the spring should be measured using a V-notch weir and the system adjusted accordingly. Future studies can be completed adjusting the loop ranking method so that two users who may be using the water system for different lengths of time are not counted the same and vulnerable users are weighted more heavily than more robust users.