Discrete Event Systems

The course is a substitute for:

Discrete Event Systems (XE33SDU)

Lecturer:

Tutor:

Supervisor:

Department of Cybernetics

Synopsis:

The course presents the systems having principally discrete characteristics (in contrast to discretised continuous systems). It concerns mainly manufacturing systems producing to order, queuing systems, transport systems, etc. The course treats modelling, control, and optimisation of such systems. Attention is paid to flexible manufacturing systems and to the methods of incremental scheduling, reactivity to failures and parameter changes.

Requirements:

Syllabus of lectures:

1. Discrete event systems (DES), types, examples

2. Modelling DES, purpose, modelling tools, structural and dynamic models

3. Parallelism in DES, static, capacity and precedence constraints

4. Graphs and networks as basic modelling tool

5. Petri nets (PN), definition, types, purpose, PN as a modelling tool

6. Sequential systems and their modelling by PN, autonomous and coloured PN's

7. Timed PN, simulation of system functionality, discovering system bottlenecks

8. Optimisation tasks for DES, the scheduling task, definition, task types

9. Task complexity of different scheduling problems

10. Classical and heuristic methods, scheduling as a constraint satisfaction task

11. Scheduling with one or more processors, processor types

12. „Flow-shop“, „open-shop“, and „job-shop“ scheduling, optimality criteria

13. Flexible systems and their scheduling

14. Incremental scheduling, reactivity to failures and parameter changes

Syllabus of tutorials:

1. Introduction, organisation of exercises

2. DES samples and examples of use

3. Modelling DES, basic tools for structural and dynamic modelling

4. Static, capacity and precedence constraints

5. Basic algorithms for graph-theoretical and network tasks

6. Petri nets (PN) - example use for practical tasks 1

7. Petri nets (PN) - example use for practical tasks 2

8. Petri nets (PN) - example use for practical tasks 3

9. Petri nets (PN) - example use for practical tasks 4

10. Scheduling tasks - definition and explanation

11. Scheduling tasks - practical task 1

12. Scheduling tasks - practical task 2

13. Scheduling as logical task with constraints 1

14. Scheduling as logical task with constraints 2 - CLP systems

Study Objective:

Study materials:

[1] Blazewicz, J., et al.: Scheduling Computer and Manufacturing Processes. Springer Verlag, 2000

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: