Operational Research in Engineering 2017

E-Learning

Platforma e-Learningowa, Wydział Zarządzania AGH: https://upel.agh.edu.pl/wz/login/index.php

Course: ore, enrolment key: ore2017, guest: oreGuest

To login you must have an account in https://dziekanat.agh.edu.pl/ and create a password on page: https://upel.agh.edu.pl/haslo/home/generate

  • = type student ID
  • Podaj numer PESEL: = type PESEL number on your ID card

Activation e-mail will be send to the e-mail address registered in https://dziekanat.agh.edu.pl/

OR The Science of Better

Literature

Books:

  1. H. A. Eiselt, Carl-Louis Sandblom, Operations Research, A Model-Based Approach, Springer, 2012. Available in the AGH library in Springer Link collection: http://wbg2.bg.agh.edu.pl/han/springer/link.springer.com/book/10.1007/978-3-642-31054-6
  2. Michalewicz, Z., Fogel, D.B., 2004. How to Solve It: Modern Heuristics. Springer, Berlin. Available in the AGH library in Springer Link collection: https://link-1springer-1com-1000048tb0487.wbg2.bg.agh.edu.pl/book/10.1007/978-3-662-07807-5

Software:

To add standard Solver choose:

File | Options | Add-Ins | Manage Excel Add-ins Go | Solver | OK

To add OpenSolver:

  • download installer from http://opensolver.org/,
  • unpack it and copy the whole content of the directory,
  • go to File | Options | Add-Ins | Manage Excel Add-ins Go | Browse
  • paste all files,
  • OK, OK,…

Lecture #1

Readings after the lecture from Eiselt, Sandblom (2012)

  • Section 1.1 The Nature and History of Operations Research
  • Chapter 2. Linear Programming, pp. 18-21
  • Section 7.1 The Critical Path Method

Lectures #2 and #3

Files with models: Lectures_2_3

Lecture #4

Readings after the lecture from Eiselt, Sandblom (2012)

  • Section 4.2.4 Modeling Fixed Charges
  • Section 4.2.2 Diet Problems Revisited
  • Section 4.2.3 Land Use
  • Section 2.2.7 Transportation and Assignment Problems (pp. 45-47)

Lecture #5

Readings after the lecture from Eiselt, Sandblom (2012)

  • Lecture notes: ore_Heuristics (code in Python in ore_Heuristics)
  • Section 4.2.5 Workload Balancing (i.e. scheduling of operations on [unrelated] parallel machines)
  • Appendix A Heuristic Algorithms

For interested and ambitious Michalewicz and Fogel (2004)

Lecture #6

Readings after the lecture from Eiselt, Sandblom (2012)

  • Section 5.1 Definitions and Conventions (Network Models)
  • Section 5.3 Shortest Path Problems (Dijkstra’s algoriyhm pp. 192-194)
  • Section 5.4 Spanning Tree Problems