Parametric Non-linear programming approach for N-policy queues with infinite capacity

This paper proposes a procedure to construct the membership function of N-policy queue with infinite capacity.  By using mathematical programming we construct the membership function of the system performance measure in which arrival rate and service rate are fuzzy numbers.  Based on a-cut approach and Zadeh’s extension principle, the fuzzy queues are converted into a family of crisp queues.  Suitable real world example is exemplified to analyze N-policy fuzzy queues.  Extending this model to fuzzy environment it would have further more wider applications

A multiple channel queueing model under an uncertain environment with multiclass arrivals for supplying demands in a cement industry

In recent years, cement consumption has increased in most Asian countries, including Malaysia. There are many factors which affect the supply of the increasing order demands in the cement industry, such as traffic congestion, logistics, weather and machine breakdowns. These factors hinder smooth and efficient supply, especially during periods of peak congestion at the main gate of the industry where queues occur as a result of inability to keep to the order deadlines. Basic elements, such as arrival and service rates, that cannot be predetermined must be considered under an uncertain environment. Solution approaches including conventional queueing techniques, scheduling models and simulations were unable to formulate the performance measures of the cement queueing system. Hence, a new procedure of fuzzy subset intervals is designed and embedded in a queuing model with the consideration of arrival and service rates. As a result, a multiple channel queueing model with multiclass arrivals, (M1, M2)/G/C/2Pr, under an uncertain environment is developed. The model is able to estimate the performance measures of arrival rates of bulk products for Class One and bag products for Class Two in the cement manufacturing queueing system. For the (M1, M2)/G/C/2Pr fuzzy queueing model, two defuzzification techniques, namely the Parametric Nonlinear Programming and Robust Ranking are used to convert fuzzy queues into crisp queues. This led to three proposed sub-models, which are sub-model 1, MCFQ-2Pr, sub-model 2, MCCQESR-2Pr and sub-model 3, MCCQ-GSR-2Pr. These models provide optimal crisp values for the performance measures. To estimate the performance of the whole system, an additional step is introduced through the TrMF-UF model utilizing a utility factor based on fuzzy subset intervals and the α-cut approach. Consequently, these models help decision-makers deal with order demands under an uncertain environment for the cement manufacturing industry and address the increasing quantities needed in future

Taxonomic classification of planning decisions in health care: a review of the state of the art in OR/MS

We provide a structured overview of the typical decisions to be made in resource capacity planning and control in health care, and a review of relevant OR/MS articles for each planning decision. The contribution of this paper is twofold. First, to position the planning decisions, a taxonomy is presented. This taxonomy provides health care managers and OR/MS researchers with a method to identify, break down and classify planning and control decisions. Second, following the taxonomy, for six health care services, we provide an exhaustive specification of planning and control decisions in resource capacity planning and control. For each planning and control decision, we structurally review the key OR/MS articles and the OR/MS methods and techniques that are applied in the literature to support decision making

Scenario simulation model for optimized allocation of construction machinery

Metode optimizacije imaju veliku važnost pri sužavanju izbora resursa na konačni i pri alokaciji resursa u svim fazama projekata. To se naročito odnosi na složena projektna okruženja gdje je potrebno provesti alokaciju resursa (strojeva) na više građevinskih projekata u njihovim raznim fazama i prioritetima. U radu se predlaže model koji se zasniva na algoritmu višekriterijske optimizacije i rangiranja scenarija suboptimalnih programa serijskog višekanalnog rada građevinskih strojeva pri konačnom broju strojeva za izbor, te izlučivanje presjeka optimalnih programa i/ili scenarija programa u složenom okruženju.Optimization methods for narrowing down the choice of resources, and for their allocation, are highly important in all phases of construction projects. This particularly concerns complex project environments where resources (construction machines) have to be allocated to several construction projects at different phases and with different priorities. The authors propose a model based on the multi-criteria optimisation algorithm and the ranking of scenarios involving sub-optimal programs for serial multi-channel operation of construction machines, with a fixed number of machines for final selection, and with separation of the optimum program and/or program scenario cross-sections in complex environment

Ensuring Service Level Agreements for Composite Services by Means of Request Scheduling

Building distributed systems according to the Service-Oriented Architecture (SOA) allows simplifying the integration process, reducing development costs and increasing scalability, interoperability and openness. SOA endorses the reusability of existing services and aggregating them into new service layers for future recycling. At the same time, the complexity of large service-oriented systems negatively reflects on their behavior in terms of the exhibited Quality of Service. To address this problem this thesis focuses on using request scheduling for meeting Service Level Agreements (SLAs). The special focus is given to composite services specified by means of workflow languages. The proposed solution suggests using two level scheduling: global and local. The global policies assign the response time requirements for component service invocations. The local scheduling policies are responsible for performing request scheduling in order to meet these requirements. The proposed scheduling approach can be deployed without altering the code of the scheduled services, does not require a central point of control and is platform independent. The experiments, conducted using a simulation, were used to study the effectiveness and the feasibility of the proposed scheduling schemes in respect to various deployment requirements. The validity of the simulation was confirmed by comparing its results to the results obtained in experiments with a real-world service. The proposed approach was shown to work well under different traffic conditions and with different types of SLAs

Cycle Time Estimation in a Semiconductor Wafer Fab: A concatenated Machine Learning Approach

Die fortschreitende Digitalisierung aller Bereiche des Lebens und der Industrie lässt die Nachfrage nach Mikrochips steigen. Immer mehr Branchen – unter anderem auch die Automobilindustrie – stellen fest, dass die Lieferketten heutzutage von den Halbleiterherstellern abhängig sind, was kürzlich zur Halbleiterkrise geführt hat. Diese Situation erhöht den Bedarf an genauen Vorhersagen von Lieferzeiten von Halbleitern. Da aber deren Produktion extrem schwierig ist, sind solche Schätzungen nicht einfach zu erstellen. Gängige Ansätze sind entweder zu simpel (z.B. Mittelwert- oder rollierende Mittelwertschätzer) oder benötigen zu viel Zeit für detaillierte Szenarioanalysen (z.B. ereignisdiskrete Simulationen). Daher wird in dieser Arbeit eine neue Methodik vorgeschlagen, die genauer als Mittelwert- oder rollierende Mittelwertschätzer, aber schneller als Simulationen sein soll. Diese Methodik nutzt eine Verkettung von Modellen des maschinellen Lernens, die in der Lage sind, Wartezeiten in einer Halbleiterfabrik auf der Grundlage einer Reihe von Merkmalen vorherzusagen. In dieser Arbeit wird diese Methodik entwickelt und analysiert. Sie umfasst eine detaillierte Analyse der für jedes Modell benötigten Merkmale, eine Analyse des genauen Produktionsprozesses, den jedes Produkt durchlaufen muss – was als "Route" bezeichnet wird – und entwickelte Strategien zur Bewältigung von Unsicherheiten, wenn die Merkmalswerte in der Zukunft nicht bekannt sind. Zusätzlichwird die vorgeschlagene Methodik mit realen Betriebsdaten aus einerWafer-Fabrik der Robert Bosch GmbH evaluiert. Es kann gezeigt werden, dass die Methodik den Mittelwert- und Rollierenden Mittelwertschätzern überlegen ist, insbesondere in Situationen, in denen die Zykluszeit eines Loses signifikant vom Mittelwert abweicht. Zusätzlich kann gezeigt werden, dass die Ausführungszeit der Methode signifikant kürzer ist als die einer detaillierten Simulation

Autonomous scheduling technology for Earth orbital missions

The development of a dynamic autonomous system (DYASS) of resources for the mission support of near-Earth NASA spacecraft is discussed and the current NASA space data system is described from a functional perspective. The future (late 80's and early 90's) NASA space data system is discussed. The DYASS concept, the autonomous process control, and the NASA space data system are introduced. Scheduling and related disciplines are surveyed. DYASS as a scheduling problem is also discussed. Artificial intelligence and knowledge representation is considered as well as the NUDGE system and the I-Space system