University at Buffalo, The State University of New York
Rakesh Nagi
Home Biography Research Teaching Professional Activities

Home

Biography

Research

• Information Fusion

• Congestion in Facilities Location and Layout

• Facility Layout (Re)Design

• Agile Manufacturing

• Real-Time Visualization

• Sensor Networks

• Facilities Design and Cellular Manufacturing

• Operations of Production Systems

• Variant Design

Teaching

• IE 684: Networks, Routing, and Logistics

• IE 661: Scheduling Theory

• IE 620: Agile Manufacturing

• IE 505: Production Planning and Control

• IE 504: Facilities Design

• IE 500: Special Topics: Logistics and Supply-Chain Management

• IE 327: Facilities Design

• IE 320: Engineering Economy

Professional Activities

Teaching Interests

IE 661: Scheduling Theory

•Course Overview
•Course Topics
•Staff
•Basic Requirements
•Required Work and Grading Policy
•References
•Lectures and Handouts
•Assignments and Projects

Course Overview

The objective of this graduate level course is to expose participants to basic scheduling theory results, and in a participatory setting, enable them to discuss and creatively synthesize these ideas to research projects of choice. It blends quantitative and qualitative material, from multiple disciplines of industrial and management engineering. The course will be conducted in a beneficial cooperative learning setting. Lectures, group discussions, research projects and participant presentations will constitute this course. The following topics will be covered.

Course Topics

Introduction
Part 1 Deterministic Models
o Framework, Notation and Complexity Hierarchy
o Single Machine Models
o Advanced Single Machine Models
o Parallel Machine Models
o Flow Shop and Flexible Flow Shops
o Job Shops
o Open Shops
Part 2’ Stochastic Models
o Introduction and Basic Results
Part 2 Project and Network Scheduling
o JIT Scheduling of Assemblies
o Integrated Lot-sizing
o Integrated Material Handling
Part 3 Scheduling in Practice
o Dispatching Rules
o Filtered Beam Search
o Local Search: SA, Tabu Seach, GA
Several Research Articles and Case Studies

Staff

Instructor:
Dr. Rakesh Nagi, Associate Professor
Department of Industrial Engineering
State University of New York at Buffalo
342 Bell Hall Box 602050
Buffalo, NY 14260-2050
U.S.A.
Telephone: (716) 645-2357
FAX: (716) 645-3302
E-mail: nagi@buffalo.edu
Office Hours: Tu, Th, 2-3pm.

Basic Requirements

Prerequisite of IE 505 Production Planning and Control or similar course
Advanced Graduate standing in engineering or management
Optimization (linear IE 572, discrete IE 573 are highly recommended)
Self motivation and a cooperative learning attitude

Required Work and Grading Policy

1. Homework - 4-5 assignments 15%
2. Class presentation - 2 lectures during the semester 10%
3. Project - one progress report, one final report, one presentation 50%. A semester long project will be performed, addressing a specific problem related to Scheduling. It should cover an in-depth literature survey related to the topic, and identify open topics from a research and/or practice perspectives. Methods covered in the course are encouraged to be applied to providing a solution to some part of the overall problem. Recommendations for further work should be included in the final report.
4. Programming project - High level languages (C/C++, Java or VB) 10%
5. Exam - one midterm 15%
Note: (+/- Grading scheme will be employed)

References

Text:
1. Pinedo, Michael, Scheduling: Theory, Algorithms, and Systems, 2nd Edition, Prentice Hall, 2002, ISBN: 0-13-028138-7

Lectures and Handouts

08/26/2003: Introduction
08/28/2003: Chapter 1
09/2003: Chapter 2
09/2003: Chapter 3
10/2003: Chapter 4
10/2003: Chapter 5
11/2003: Chapter 6
11/2003: Complexity Theory
*A number of these lectures were developed by students and presentation materials from the author of the Text.

Assignments and Projects

Assignment 1
Assignment 2
Assignment 3

Contact information: Phone: (716) 645-2427 • Fax: (716) 645-3302 • E-mail: nagi@buffalo.edu

Copyright 2003, University at Buffalo, All rights reserved.