Metaheuristic OR670/SYST670/OR750

Instructor: Dr. Rajesh Ganesan

Class time: Wed 7:20-10:00PM

 

    

Office: Engr Building, Room 2217

Phone: (703) 993-1693                                                    

Fax: (703) 993-1521                                                                                 

Email: rganesan@gmu.edu

 

 

Syllabus.doc

https://link.springer.com/book/10.1007/978-1-4419-0910-7   Planning and Scheduling in mfg and service M Pinedo

http://paradiseo.gforge.inria.fr/

https://ia801309.us.archive.org/2/items/OperationalResearchWinstonWayne/Operational-Research-Winston-Wayne.pdf Winston's book for OR 541/2

https://link.springer.com/content/pdf/10.1007%2F978-3-319-07124-4.pdf   Hand Book of Heuristics Marti, Rafael et al.

https://www.researchgate.net/file.PostFileLoader.html?id=5703bd8e4048546d0943c349&assetKey=AS%3A347504454455296%401459862926298

METAHEURISTICS FROM DESIGN TO IMPLEMENTATION Talbi

 

Week 1

Introduction  in pdf

 

Week 2 

S-metaheuristics

Metaheuristics Implementation: Binary local search, Tabu search, Job shop scheduling, Knapsack, TSP  excel examples

 

Week 3

Tabu examples: m machines n jobs -  parallel machines, and flow shop, set covering

Simulated Annealing, examples-Job shop scheduling. knapsack

Chapter 1-3 review

Practice problems

 

Week4

Multi-start search, ILS, GRASP, VNS, GLS notes 4

Dispatching rules - page 442 of text

Chapter- 4 PERT, CPM,

 

Week 5 Sept 28

Time-Cost Trade-off heuristic - chapter 4

ATC and ATCS - Page 446 of text

Chap 5 Shifting Botteneck Heuristics notes 5 with 2 different objectives - min(makespan) and min (weighter tardiness)

Solution for min(makespan)

Solution for weighter tardiness in handout

 

Midterm  due Nov 14

 

 

Week 6

Flexible assembly ascheduling paced and unpaced lines with and without buffer

Minimum part set MPS

Profile fitting,

Chapter 6  notes 6

 

Week 7

GS, and  FFLL heuristic FFLL excel

P-metaheuristics   notes 

 

Week 8

Lot sizing and sequencing chapter 7 notes

FFS heuristic example

SCM - chapter 8 (self read)

 

Week 9

GA example excel (refer handout)

Scatter search, EDA.

Genetic Programming, Ant colony optimization notes

 

Week 10

PSO notes

Reservation and Timetabling  Chapter 9

Reservation without slack heuristic ( Max # of activities assigned to resource i)

Reservation without slack heuristic (Min # of resources needed)

Reservation with slack heuristic  (Max weighted # of activities)

First Fit (FF) - timetabling with workforce constraint

FFD First Fit Decreasing

Graph coloring heuristic-  timetabling with operator or tooling constraint

 

Week 11 - Nov 7th - No class

Final Exam  Due Dec 12

Project Due Dec 12

 

Week 12

Timetabling with cost minimization

Timetabling with both resource and tooling constraints -Project scheduling - workforce, tooling, unequal processing times, and with precedence constraints (requires a combination of heuristics)

Bee colony and AIS notes

Timetabling in sports chapter 10

 

 

Week 13 - Nov 21st No class Thanks Giving

 

Week 14

Chapter 11 and 12. No new heuristics.Mostly integer programmning, which could be replaced by other standard heuristics.

Workforce scheduling chapter 13 notes

Days off scheduling

 

Week 15

Shift and Cyclic scheduling

Crew Scheduling

Multi-obj optimization, hybrid and parallel metaheuristics notes

 

Heuristics list:

S- Metaheuristics

1. Binary local search

2. Tabu search

3. Simulated Annealing

4. Multi-start search

5. ILS - Iterative local serch

6.GRASP-greedy randomized adaptive search procedure

7. VNS - variable neighborhood search

8. GLS- guided local search

 

Appendix C of text

9. Several Dispatch rules  

10.Composite dispatch rules - ATC and ATCS - 1 m/c n jobs scheduling with set up time

11. Beam search as a quick alternative to branch and bound - Ex from text.

 

Chapter 4

12. PERT

13. CPM - Ex from text.

14.  Time/Cost tradeoff heuristics -Ex from text.

 

Chapter 5

15. Shifting Bottleneck heuristics - m m/c- n jobsj-ob shop with precedence constraints-makespan obj fnc Ex from text.

16. Shifting Bottleneck heuristics - m m/c- n jobsj-ob shop with precedence constraints-weighted tardiness obj fnc Ex from handout

 

Chapter 6

17. Unpaced flexible assembly lineProfile fitting heuristic (PF)

18. Paced flexible assembly lineGrouping and Spacing Heuristic (GS)

19. Flexible Flow systems with BypassFlexible flow line loading algorithm is used (FFLL)

 

P-Metaheuristics

20. GA - Genetic Alg

21- Scatter search

22.  Estimation of Distribution (EDA) Alg

 

Chapter 7

Rotation Schedules

23. FFS heuristics - Frequency fitting and sequencing without set up time

24. FFS heuristics - Frequency fitting and sequencing with set up time

 

P-Metaheuristics

25. Genetic Programming

26. Ant Colony Optimization

 

Chapter 9

 

27) Reservation without slack heuristic ( Max # of activities assigned to resource i)

28) Reservation without slack heuristic (Min # of resources needed)

29) Reservation with slack heuristic  (Max weighted # of activities)

30) First Fit (FF) - time tabling with workforce constraint

31) FFD First Fit Decreasing

32) Graph coloring heuristic-  time tabling with operator or tooling constraint

33) time tabling with cost minimization

34) project scheduling - workforce, tooling, unequal processing times, and with precedence constraints (requires a combination of heuristics)

P-Metaheuristics

 

35) PSO -particle swarm opt

36) Bee Colony opt

37) Artificial immume system

 

Chapter 10

38) Single and double round robin heuristic

Chapter 13

39) Days-off scheduling heuristic

40) Crew scheduling heuristic