Wyniki wyszukiwania - BazTech

1

Arena Simulation Software as an example of the discrete event simulator

Iwańczyk I.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Łódzka

|

2015

|

z. 62

49--71

EN

The goal of this article is to briefly present Arena Simulation Software as an example of Discrete Event Simulator used for modelling queuing systems. It contains example Case Study and the key factors that may be vital when making a purchasing and implementation decision of the Simulation Software.

PL

Celem artykułu jest prezentacja oprogramowania Arena Simulation Software jako przykład symulatora zdarzeń dyskretnych systemów modelowania wykorzystywanych do kolejkowania. Artykuł zawiera przykładowy case study oraz kluczowe czynniki, które mogą mieć istotne znaczenie przy dokonywaniu zakupów i realizacji decyzji.

2

Estimation of next human action and its timing based on the human action model considering time series information of the situation

Hashimoto K., Doki K., Doki S.

Journal of Artificial Intelligence and Soft Computing Research

|

2012

|

Vol. 2, No. 3

223--233

EN

In order to realize a system that supports human actions timely, the system must have a certain model of human actions. Therefore, we propose a modeling method of human actions. In this method, it is supposed that a person changes his action according to the situation around him, and the causality between the situation around a person and the change of a human action is modeled. This causality is expressed by an If-then-Rule style where a human action and the situation around a human are expressed by a discrete event and time series data respectively. Moreover, as the necessary function for human support systems, an estimation method of the next human action and its execution timing is consisted based on the proposed modeling method. The usefulness of the proposed modeling and estimation methods is examined through the estimation experiment of next human action and its execution timing with a radio-controlled vehicle.

3

Timed Petri-Net Based Formulation and an Algorithm for the Optimal Scheduling of Batch Plants

Gu T., Bahri P. A., Cai G.

International Journal of Applied Mathematics and Computer Science

|

2003

|

Vol. 13, no 4

527-536

EN

The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis of behavioural properties and performance evaluation, as well as for the systematic construction of discrete-event simulators and controllers. This paper aims at presenting a Petri-net based approach to the scheduling of operations in batch plants. Firstly, the short term of the `scheduling of batch plants' is formulated by means of a timed Petri net which can accommodate various intermediate storage policies, such as unlimited intermediate storage (UIS), no intermediate storage (NIS), finite intermediate storage (FIS), and mixed intermediate storage (MIS). Secondly, a heuristic search algorithm for the optimal scheduling of batch plants is given, which is based on generating and checking the markings in the reachability tree of the Petri-net model. Finally, the novel formulation and algorithm are tested with several simulation case studies.