Programme

Scheduling with limited capacity. Introduction to job shop scheduling.
Job shop scheduling : Move v(x,y) and conditions regarding its improvement.
Job shop scheduling : Tabu search algorithm of Nowicki e Smutnicki (1996).
Job shop scheduling : Lower bound tecnique of Taillard. Numerical examples.
Job shop scheduling : Topological order. Tabu search algorithm of Nowicki e Smutnicki (2005).
Job shop scheduling : Algorithm of Carlier e Pinson (1989). Primary lower bound on a single machine.
Job shop scheduling : Algorithm of Carlier e Pinson (1994). Dual lower bound on a single machine.
Job shop scheduling : Immediate selections.

Core Documentation

Material given by the professor via the moodle page of the course, including lecture slides and scientific papers

Reference Bibliography

Available on the moodle page of the course

Type of delivery of the course

Frontal teaching lessons. Classroom exercises.

Attendance

Frequency suggested but not mandatory.

Type of evaluation

Learning verification takes place through a written exam lasting a few hours, plus a subsequent oral exam. The written exam is organized through exercises and theoretical questions, aimed at verifying the level of effective understanding of the course contents. Self-assessment tests and classroom exercises are scheduled during the course. "In the COVID-19 emergency period, the profit examination will be carried out in accordance with article 1 of the Rectoral Decree no. 703 of May 5th, 2020"

Programme

1. Non-linear programming
Gradient, Hessian
Local minimum, Necessary conditions (first and second order)
Local minimum, Sufficient conditions (secondo order and convex case)
Gradient method, Line search
Newton method,
2. Constrained non-linear programming
KKT conditions
Barrier method and Penalty functions
3. Lot Sizing
EOQ model
Wagner-Whitin Algorithm
Zangwill Algorithm
4. Job Shop Scheduling
Exact methods, Carlier-Pinson Algorithm
Euristhic methods, Nowicki-Smutnicki Algorithm
5. Vehicle Routing Problem
6. Crew Scheduling
7. Plant Location

Core Documentation

Lecture notes

Reference Bibliography

Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014. Sassano A., "Modelli e Algoritmi della Ricerca Operativa", Franco Angeli. Carlier J., Pinson E., “An algorithm for solving the job shop problem”, Management Science, 35 (2), 164-175 (1989). Carlier J., Pinson E., “Adjustment of heads and tails for the job-shop problem”, European Journal of Operational Research, 78 (2), 146-161 (1994). Brucker P., Jurisch B., Sievers B., “A branch and bound algorithm for the job scheduling shop problem”, Discrete Applied Mathematics, 49, 107-127 (1994). Nowicki E., Smutnicki C., “A fast taboo search algorithm for the job shop problem”, Management Science, 42 (6), 797-813 (1996). Nowicki E., Smutnicki C., “An advanced tabu search algorithm for the job shop problem”, Journal of Scheduling, 8, 145-159 (2005). Il PDF è scaricabile qui da un PC di Roma Tre. Heinz Gröflin, Andreas Klinkert, "A new neighborhood and tabu search for the Blocking Job Shop", Discrete Applied Mathematics, 157 (2009), 3643-3655.Il PDF è scaricabile qui da un PC di Roma Tre. Yazid Mati and Xiaolan Xie, "Multiresource Shop Scheduling With Resource Flexibility and Blocking", IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, in press Christoph J. Schuster, Jose M. Framinan, "Approximative procedures for no-wait job shop scheduling", Operations Research Letters, 31 (2003) 308 – 318.Il PDF è scaricabile qui da un PC di Roma Tre.

Type of delivery of the course

Classroom lectures and exercises.

Attendance

Classroom lectures and exercises.

Type of evaluation

The exam consists of two steps. In the written part the student is asked to solve two exercises and one or more theoretical questions. The oral part consists of one or more questions on the written part and/or theoretical questions. The texts of the exams of the last years are available on the web page of the course (http://pacciarelli.dia.uniroma3.it/CORSI/MSP/Welcome.html ).

Programme

1. Non-linear programming
Gradient, Hessian
Local minimum, Necessary conditions (first and second order)
Local minimum, Sufficient conditions (secondo order and convex case)
Gradient method, Line search
Newton method,
2. Constrained non-linear programming
KKT conditions
Barrier method and Penalty functions
3. Lot Sizing
EOQ model
Wagner-Whitin Algorithm
Zangwill Algorithm
4. Job Shop Scheduling
Exact methods, Carlier-Pinson Algorithm
Euristhic methods, Nowicki-Smutnicki Algorithm
5. Vehicle Routing Problem
6. Crew Scheduling
7. Plant Location

Core Documentation

Lecture notes

Reference Bibliography

Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014. Sassano A., "Modelli e Algoritmi della Ricerca Operativa", Franco Angeli. Carlier J., Pinson E., “An algorithm for solving the job shop problem”, Management Science, 35 (2), 164-175 (1989). Carlier J., Pinson E., “Adjustment of heads and tails for the job-shop problem”, European Journal of Operational Research, 78 (2), 146-161 (1994). Brucker P., Jurisch B., Sievers B., “A branch and bound algorithm for the job scheduling shop problem”, Discrete Applied Mathematics, 49, 107-127 (1994). Nowicki E., Smutnicki C., “A fast taboo search algorithm for the job shop problem”, Management Science, 42 (6), 797-813 (1996). Nowicki E., Smutnicki C., “An advanced tabu search algorithm for the job shop problem”, Journal of Scheduling, 8, 145-159 (2005). Il PDF è scaricabile qui da un PC di Roma Tre. Heinz Gröflin, Andreas Klinkert, "A new neighborhood and tabu search for the Blocking Job Shop", Discrete Applied Mathematics, 157 (2009), 3643-3655.Il PDF è scaricabile qui da un PC di Roma Tre. Yazid Mati and Xiaolan Xie, "Multiresource Shop Scheduling With Resource Flexibility and Blocking", IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, in press Christoph J. Schuster, Jose M. Framinan, "Approximative procedures for no-wait job shop scheduling", Operations Research Letters, 31 (2003) 308 – 318.Il PDF è scaricabile qui da un PC di Roma Tre.

Type of delivery of the course

Classroom lectures and exercises.

Attendance

Classroom lectures and exercises.

Type of evaluation

The exam consists of two steps. In the written part the student is asked to solve two exercises and one or more theoretical questions. The oral part consists of one or more questions on the written part and/or theoretical questions. The texts of the exams of the last years are available on the web page of the course (http://pacciarelli.dia.uniroma3.it/CORSI/MSP/Welcome.html ).

Programme

Scheduling with limited capacity. Introduction to job shop scheduling.
Job shop scheduling : Move v(x,y) and conditions regarding its improvement.
Job shop scheduling : Tabu search algorithm of Nowicki e Smutnicki (1996).
Job shop scheduling : Lower bound tecnique of Taillard. Numerical examples.
Job shop scheduling : Topological order. Tabu search algorithm of Nowicki e Smutnicki (2005).
Job shop scheduling : Algorithm of Carlier e Pinson (1989). Primary lower bound on a single machine.
Job shop scheduling : Algorithm of Carlier e Pinson (1994). Dual lower bound on a single machine.
Job shop scheduling : Immediate selections.

Core Documentation

Material given by the professor via the moodle page of the course, including lecture slides and scientific papers

Reference Bibliography

Available on the moodle page of the course

Type of delivery of the course

Frontal teaching lessons. Classroom exercises.

Attendance

Frequency suggested but not mandatory.

Type of evaluation

Learning verification takes place through a written exam lasting a few hours, plus a subsequent oral exam. The written exam is organized through exercises and theoretical questions, aimed at verifying the level of effective understanding of the course contents. Self-assessment tests and classroom exercises are scheduled during the course. "In the COVID-19 emergency period, the profit examination will be carried out in accordance with article 1 of the Rectoral Decree no. 703 of May 5th, 2020"