|
Lecturer
Dates & Places
- Tuesday 16.00-18.00 Se1
- Thursday 16.00-18.00 Se2
- Exams
- April 20, 2010, 16.00-18.00 HS6
- June 17, 2010, 16.00-18.00 HS5
- Student's presentations
- June 10, 2010, 16.00-18.00 Se2
- "Iterated Ants: An Experimental Study for the
Quadratic Assignment Problem" (Wiesemann, Stützle). Presented by
Gregor Gahbauer
- "Optimization of the quadratic assignment problem using an ant colony algorithm" (Demirel, Toksari). Presented by Vedad Basic
- "Ant colony optimization algorithm to the inter-cell
layout problem in cellular manufacturing" (Solimanpur, Vrat, Shankar).
Presented by Madita Dejakum.
- June 15, 2010, 16.00-18.00 Se1
- "A dynamic programming based heuristic for the assembly line balancing problem" (Bautista, Pereira). Presented by Florian Manzer
- "Balancing assembly lines with tabu search" (Lapierre, Ruiz, Soriano). Presented by Josipa Bagaric
Study Programs
- Mag.
internationale
Betriebswirtschaft
- KFK Logistikmanagement, KFK
Produktionsmanagement
- KFK Production Management, KFK Transportation Logistics, KFK Supply Chain Management
- Mag.
Betriebswirtschaft
- KFK Logistikmanagement, KFK
Produktionsmanagement
- KFK Production Management, KFK Transportation Logistics, KFK Supply Chain Management
- Mag. Wirtschaftsinformatik
- KFK Produktionsmanagement
Course Content
- Topics Covered
- This course deals with tactical problems of production and logistics, namely layout and design.
Main topics are:
- configuration problems in job shop production (Werkstattproduktion)
linear assignment problems
qudratic assignment problems
- configuration problems in cellular manufacturing systems (Inselproduktion)
- configuration problems in flow shop production (Fließfertigung)
- simple assembly line balancing problems
mixed model assembly
- configuration of warehouses
- configuration and analysis of flexible manufacturing systems
- Methods used
- the following methods will be presented in the various application areas
- specialized exact methods (e.g. Kuhn's algorithm)
- generic exact methods Branch and bound
- mathematical programming formulation (LP, IP, MIP, ...) for use in standard solvers
- dedicated starting heuristics
- improvement heuristics, local search
- metaheuristics
Requirements
- mid term exam (40%)
- final exam (40%)
- participation in class (20%): presentation, discussion, numerical examples, etc.
Prerequisites
- Prerequisite:
appropriate Bachelor degree (with basic knowledge of production and
operations management, e.g. "ABWL Produktion & Logistik")
- It is suggested that you take this course only after having taken one of the courses „Operations
Management“ (old "Studienplan") or "Transportation Logistics
(TL)", "Production Analysis", or "Supply Chain Management"
(new "Studienplan")
Basic Literature
-
nAskin, R.G., Standridge, C.R.: Modeling & Analysis Of Manufacturing Systems, John Wiley & Sons, 1993
-
Nahmias, S.: Production and Operations Analysis, 4th ed., McGraw-Hill, 2000
- Günther, H.-O., Tempelmeier, H.: Produktion und Logistik, Springer, 2005
- Nahmias, S.: Production and Operations Analysis, 4th ed., McGraw-Hill, 2000
- Zäpfel, G., Taktisches Produktionsmanagement, Gruyter, 1989
- Heizer, J., Render, B., Operations Management, Prentice Hall, 2006
- Domschke, W., Scholl, A., Voß, S., Produktionsplanung, Springer, 2005
- Francis, R., McGinnis, L., White, J., Facility Layout and Location: An Analytical Approach, Prentice Hall, 1992
Downloads
Results
|
|
