• Increase font size
  • Default font size
  • Decrease font size

vol. 2, no. 1,2006

ANT ALGORITHMS APPLIED TO ELECTRONIC SYSTEMS DIAGNOSIS

Main problems of using ant algorithms in diagnosis are presented in this article. A knowledge representation and a searching solution mechanism with help of ant algorithms were elaborated. Performed algorithm is shown by exemplary system diagnosing TV set.

OPTIMIZATION AS A TOOL FOR TIME REDUCTION IN SIMULATION PROJECTS

This paper presents the optimization methods appropriate for discrete event simulations of manufacturing systems. The chosen optimization approach was applied in various simulation projects. Given example shows practically how can be utilize optimization in simulation. The paper presents the results of simulation and time reductions achieved through optimisation.

FUZZY MODEL FOR THE INFORMATION AND DECISION MAKING SUPPORT SYSTEM FOR THE CFM BRANCH COMPANY

The aim of this work is to present the ways of improvement the management process in the CFM company, by developing and implementing the Management Information System (MIS). In the first chapter the characteristic of Car Fleet Management company is presented. The second chapter describes how MIS could support management of that type of company, as well as general and functional requirements of the computer application. Third chapter presents an example of methodology of solving selected decision-making problem using a fuzzy rule-based model.

CP-BASED DECISION SUPPORT PACKAGE FOR PRODUCTION FLOW PLANNING - AN SME PERSPECTIVE

Solving complex, decision-making problems requires application of decision support systems. The best solving strategy can be defined for each particular problem. The strategy refers to a sequence solving elementary subproblems. The aim of the paper is to present the evaluating criterion to estimate the efficiency of searching strategies. The criterion proposed offers a possibility to estimate the time needed to solve a constraint satisfaction problem. An illustrative example is provided.

CONSTRAINT-BASED SCHEDULING IN OZ/MOZART

In this paper we present how scheduling problems can be solved in the concurrent constraint programming (CCP) language Oz. Oz is the first highlevel constraint language, which offers programmable search, modularity, expressiveness and an interface to invent new constraints using C++. As an example of scheduling problem the job-shop scheduling problem with manpower resources representation was considered. The objective discussed here is the minimization of the makespan. Allocating manpower to the jobs is more complicated than allocating machines, as different jobs and operations require different manpower. This problem is strongly NP-hard. We proposed the constraint programming (CP) based approach to decision support in this environment. The most important features of CP are declarative problem modeling, allowing a clear separation between the problem statement (variables and constraints) and the resolution of the problem

Page 1 of 2

  • «
  •  Start 
  •  Prev 
  •  1 
  •  2 
  •  Next 
  •  End 
  • »