A timed Petri net framework to find optimal IRIS schedules

Matthias Werner

The search session has expired. Please query the service again.

Displaying similar documents to “A timed Petri net framework to find optimal IRIS schedules”

Timed Petri-net based formulation and an algorithm for the optimal scheduling of batch plants

Tianlong Gu, Parisa Bahri, Guoyong Cai (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

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...

Dynamic Programming: an overview

Moshe Sniedovich, Art Lew (2006)

Control and Cybernetics

Similarity:

Solving scheduling problems using Petri nets and constraint logic programming

P. Richard, C. Proust (1998)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Achieving Optimal Design of the Production Line With Obtainable Resource Capacity

Miao-Sheng Chen, Chun-Hsiung Lan (2002)

The Yugoslav Journal of Operations Research

Similarity:

Heuristic Approach to Train Rescheduling

Snežana Mladenović, Mirjana Čangalović (2007)

The Yugoslav Journal of Operations Research

Similarity:

Reservation table scheduling: branch-and-bound based optimization . integer linear programming techniques

Hadda Cherroun, Alain Darte, Paul Feautrier (2007)

RAIRO - Operations Research

Similarity:

The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target...

Interconnect synthesis in high speed digital VLSI routing.

Sayed, Moustafa A., Maksoud, Ehab Y.Abdel (2009)

International Journal of Open Problems in Computer Science and Mathematics. IJOPCM

Similarity:

Realization of Knapsack Problem Solving Algorithm and some of Its Applications

Dimiter Ivanchev, Elena Radovanova (2009)

The Yugoslav Journal of Operations Research

Similarity:

Periodic coordination in hierarchical air defence systems

Piotr Arabas, Krzysztof Malinowski (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

The subject of this work is the defence planning of a point target against an air attack. The defence system is decomposed into a number of sectors. A direct method of coordination is used at the upper level, while the sectors use a discrete-time event-based model and the description of uncertainty by multiple scenarios of an attack. The resulting problems are solved using linear programming. A comparison of two coordination strategies for realistic attack scenarios and an analysis of...

Emotion learning: Solving a shortest path problem in an arbitrary deterministic environment in linear time with an emotional agent

Silvana P Etruseva (2008)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents an algorithm which solves the shortest path problem in an arbitrary deterministic environment with n states with an emotional agent in linear time. The algorithm originates from an algorithm which in exponential time solves the same problem, and the agent architecture used for solving the problem is an NN-CAA architecture (neural network crossbar adaptive array). By implementing emotion learning, the linear time algorithm is obtained and the agent architecture is modified....

Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent

Silvana Petruseva (2006)

The Yugoslav Journal of Operations Research

Similarity:

ACS-TS: Train scheduling using ant colony system.

Ghoseiri, Keivan, Morshedsolouk, Fahimeh (2006)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Scheduling multiprocessor tasks on two parallel processors

Jacek Błażewicz, Paolo Dell&#039;Olmo, Maciej Drozdowski (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.