Témata prací (Výběr práce)Témata prací (Výběr práce)(verze: 368)
Detail práce
   Přihlásit přes CAS
Constrained activity sequencing
Název práce v češtině: Constrained activity sequencing
Název v anglickém jazyce: Constrained activity sequencing
Akademický rok vypsání: 2008/2009
Typ práce: diplomová práce
Jazyk práce: angličtina
Ústav: Katedra teoretické informatiky a matematické logiky (32-KTIML)
Vedoucí / školitel: prof. RNDr. Roman Barták, Ph.D.
Řešitel: skrytý - zadáno a potvrzeno stud. odd.
Datum přihlášení: 13.11.2008
Datum zadání: 13.11.2008
Datum a čas obhajoby: 07.09.2010 00:00
Datum odevzdání elektronické podoby:07.09.2010
Datum proběhlé obhajoby: 07.09.2010
Oponenti: prof. RNDr. Ondřej Čepek, Ph.D.
 
 
 
Zásady pro vypracování
Diploma thesis deals with activity sequencing with feasibility constraints and objective functions. Student will familiarize himself with existing scheduling techniques and models. Based on this survey he will propose a suitable formal model for a selected problem together with formal description of feasibility constraints and objective function. The model will be motivated by existing real-life problems, for example from the area of scheduling in the airline industry. The student will also propose new or adapt existing solving algorithm that finds (near)optimal sequences of activities.
Seznam odborné literatury
Philippe Baptiste, Claude Le Pape, Wim Nuijten: Constraint-Based Scheduling, Applying Constraint Programming to Scheduling Problems, Springer Verlag, 2001

Joseph Y-T. Leung (editor): Handbook of Scheduling - Algorithms, Models, and Performance Analysis, Chapman&Hall/CRC, 2004.

Michael Pinedo: Planning and Scheduling in Manufacturing and Services, Springer Verlag, 2005.
Předběžná náplň práce
Many scheduling problems can be seen as activity sequencing problems, where the activity sequence in demand satisfies certain constraints. A typical example is scheduling in the airline industry where the task is to assign each aicraft to flight segments while guaranteeing sufficiently frequent maintenance checks. Diploma thesis deals with such type of constrained activity sequencing. The aim is to propose a formal model of the problem including specification of all constraints and objectives. The model will be motivated by a selected real-life problem, for example from the area of airline scheduling. The student will also propose new or adapt existing solving algorithm that finds (near)optimal sequences of activities.
Předběžná náplň práce v anglickém jazyce
Many scheduling problems can be seen as activity sequencing problems, where the activity sequence in demand satisfies certain constraints. A typical example is scheduling in the airline industry where the task is to assign each aicraft to flight segments while guaranteeing sufficiently frequent maintenance checks. Diploma thesis deals with such type of constrained activity sequencing. The aim is to propose a formal model of the problem including specification of all constraints and objectives. The model will be motivated by a selected real-life problem, for example from the area of airline scheduling. The student will also propose new or adapt existing solving algorithm that finds (near)optimal sequences of activities.
 
Univerzita Karlova | Informační systém UK