Modeling Decision Systems via Uncertain Programming

By uncertain programming we mean the optimization theory in generally uncertain (random, fuzzy, rough, fuzzy random, etc.) environments. The main purpose of this paper is to present a brief review on uncertain programming models, and classify them into three broad classes: expected value model, chanceconstrained programming and dependent-chance programming. This presentation is based on the book: B. Liu, Theory and Practice of Uncertain Programming, PhisicaVerlag, Heidelberg, 200

The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review

Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.Peer Reviewe

An investigation of the trading agent competition : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University, Albany, New Zealand

The Internet has swept over the whole world. It is influencing almost every aspect of society. The blooming of electronic commerce on the back of the Internet further increases globalisation and free trade. However, the Internet will never reach its full potential as a new electronic media or marketplace unless agents are developed. The trading Agent Competition (TAC), which simulates online auctions, was designed to create a standard problem in the complex domain of electronic marketplaces and to inspire researchers from all over the world to develop distinctive software agents to a common exercise. In this thesis, a detailed study of intelligent software agents and a comprehensive investigation of the Trading Agent Competition will be presented. The design of the Risker Wise agent and a fuzzy logic system predicting the bid increase of the hotel auction in the TAC game will be discussed in detail

Peirce's sign theory as an open-source R package.

Throughout Peirce’s writing, we witness his developing vision of a machine that scientists will eventually be able to create. Nadin (2010) raised the question:Why do computer scientists continue to ignore Peirce’s sign theory? A review of the literature on Peirce’s theory and the semiotics machine reveals that many authors discussed the machine;however, they donot differentiate between a physical computer machine and its software. This paper discusses the problematic issues involved in converting Peirce’s theory into a programming language, machine and software application. We demonstrate this challenge by introducing Peirce’s sign theory as a software application that runs under an open-source R environmen

Project scheduling under undertainty – survey and research potentials.

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, that is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, stochastic GERT network scheduling, fuzzy project scheduling, robust (proactive) scheduling and sensitivity analysis. We discuss the potentials of these approaches for scheduling projects under uncertainty.Management; Project management; Robustness; Scheduling; Stability;

Measuring Technical Efficiency of Dairy Farms with Imprecise Data: A Fuzzy Data Envelopment Analysis Approach

This article integrates fuzzy set theory in Data Envelopment Analysis (DEA) framework to compute technical efficiency scores when input and output data are imprecise. The underlying assumption in convectional DEA is that inputs and outputs data are measured with precision. However, production agriculture takes place in an uncertain environment and, in some situations, input and output data may be imprecise. We present an approach of measuring efficiency when data is known to lie within specified intervals and empirically illustrate this approach using a group of 34 dairy producers in Pennsylvania. Compared to the convectional DEA scores that are point estimates, the computed fuzzy efficiency scores allow the decision maker to trace the performance of a decision-making unit at different possibility levels.fuzzy set theory, Data Envelopment Analysis, membership function, α-cut level, technical efficiency, Farm Management, Production Economics, Productivity Analysis, Research Methods/ Statistical Methods, Risk and Uncertainty, D24, Q12, C02, C44, C61,