540 research outputs found

    A Goal Programming Approach for Multiple Objective Green Supply Chain Management

    Get PDF
    Today s green supply chain management GSCM has become a protective approach to increase awareness against SCMenvironmental impact Green strategies have become vital issue for companies to gain environmental sustainability last year s research shows that the production transportation storage and consumption of all these goods related environmental aspect such as emission of greenhouse gases This paper focuseson the design planning and controlling in supply chain for transportation and facility There are several methods for solving multi-objective linear programming MOLP models among them we use the fuzzy programming approaches to solve bi-objective model on the other hand weusetriangular fuzzy number to translate the subjective human perception into a solid crisp value and utilize the fuzzy number approach for uncertain demands one numerical example is presented to show that our proposed metho

    Acta Cybernetica : Tomus 7. Fasciculus 3.

    Get PDF

    Modeling and Analysis of Multicommodity Network Flows via Goal Programming

    Get PDF
    In this research we focused on the mobility system modeled by the AMC mobility planner\u27s calculator (AMPCALC). We developed AMPCALC as a user-friendly tool and allow the user to easily carry out strategic airlift, air refueling and aeromedical evacuation calculations that are covered in Air Force Pamphlet 10-1403. In this study, Excel software and its macro language, Visual Basic for Application, are our two main tools. In the methodology of the thesis we examined fundamental aspects of the mobility system in AMPCALC. We discussed formulation logic of the mobility cycle. We presented ramp use optimization and tanker optimization processes. We also conducted verification and validation of AMPCALC. Sensitivity analysis of the model includes a response surface study. To be able to investigate the main effects and interaction effects of the input factors on closure time, we performed a 26 factorial design. No linear relations are observed, but some relations between inputs and closure time are observed

    Artificial Intelligence Research Branch future plans

    Get PDF
    This report contains information on the activities of the Artificial Intelligence Research Branch (FIA) at NASA Ames Research Center (ARC) in 1992, as well as planned work in 1993. These activities span a range from basic scientific research through engineering development to fielded NASA applications, particularly those applications that are enabled by basic research carried out in FIA. Work is conducted in-house and through collaborative partners in academia and industry. All of our work has research themes with a dual commitment to technical excellence and applicability to NASA short, medium, and long-term problems. FIA acts as the Agency's lead organization for research aspects of artificial intelligence, working closely with a second research laboratory at the Jet Propulsion Laboratory (JPL) and AI applications groups throughout all NASA centers. This report is organized along three major research themes: (1) Planning and Scheduling: deciding on a sequence of actions to achieve a set of complex goals and determining when to execute those actions and how to allocate resources to carry them out; (2) Machine Learning: techniques for forming theories about natural and man-made phenomena; and for improving the problem-solving performance of computational systems over time; and (3) Research on the acquisition, representation, and utilization of knowledge in support of diagnosis design of engineered systems and analysis of actual systems

    Acta Cybernetica : Volume 15. Number 2.

    Get PDF

    Algorithms for Scheduling Problems and Integer Programming

    Get PDF
    The first part of this thesis gives approximation results to scheduling problems. The classical makespan minimization problem on identical parallel machines asks for a distribution of a set of jobs to a set of machines such that the latest job completion time is minimized. For this strongly NP-complete problem we give a new EPTAS algorithm. In fact, it admits a practical implementation which beats the currently best approximation ratio of the MULTIFIT algorithm. A well-studied extension of the problem is the partition of the jobs into classes which impose a class-specific setup time on a machine whenever the processing switches to a job of a different class. For these so-called scheduling problems with batch setup times we present a 1.5-approximation algorithm for each of the three major settings. We achieve similar results for the likewise natural variant of many shared resources scheduling (MSRS) where instead of imposing a setup time each class is identified by a resource which can be occupied by at most one of its jobs at a time. For MSRS we present a 1.5-approximation and two EPTAS results. The second part provides results for fixed-priority uniprocessor real-time scheduling and variants of block-structured integer programming. We give a new approach to compute worst-case response times which admits a polynomial-time algorithm for harmonic periods even in the presence of task release jitters. In more detail, we prove a duality between Response Time Computation (RTC) and the Mixing Set problem. Furthermore, both problems can be expressed as block-structured integer programs which are closely related to simultaneous congruences. However, the setting of the famous Chinese Remainder Theorem is that each congruence has to have a certain remainder. We relax this setting such that the remainder of each congruence may lie in a given interval. We show that the smallest solution to these congruences can be computed in polynomial time if the set of divisors is harmonic

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

    Get PDF
    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

    Learning-based short-time prediction of photovoltaic resources for pre-emptive excursion cancellation

    Get PDF
    There is a growing interest in using renewable energy resources (RES) such as wind, solar, geothermal and biomass in power systems. The main incentives for using renewable energy resources include the growing interest in sustainable and clean generation as well as reduced fuel cost. However, the challenge with using wind and solar resources is their indeterminacy which leads to voltage and frequency excursions. In this dissertation, first, the economic dispatch (ED) problem for a community microgrid is studied which explores a community energy market. As a result of this work, the importance of modeling and predicting renewable resources is understood. Hence, a new algorithm based on dictionary learning for prediction of solar production is introduced. In this method, a dictionary is trained to carry various behaviors of the system. Prediction is performed by reconstructing the tail of the upcoming signal using this dictionary. To improve the accuracy of prediction, a new approach based on a novel clustering-based Markov Switched Autoregressive Model is proposed that is capable of predicting short-term solar production. This method extracts autoregressive features of the training data and partitions them into multiple clusters. Later, it uses the representative feature of each cluster to predict the upcoming solar production level. Additionally, a Markov jump chain is added to improve the robustness of this scheme to noise. Lastly, a method to utilize these prediction mechanisms in a preemptive model predictive control is explored. By incorporating the expected production levels, a model predictive controller is designed to preemptively cancel the upcoming excursions --Abstract, page iv
    • …
    corecore