1. Environmentally Conscious Design and Manufacturing

Environmentally Conscious Design and Manufacturing (ECD&M) is an environmental view of manufacturing that includes social and technological aspects of design, manufacturing, use and end-of-life of products.
Included in this course are:

  • Environmental Issues: Global View
  • Sustainability
  • Sustainable development
    • Environmental Issues : Industrial View
  • Life Cycle Assessment (LCA)
  • Design for Environment (DFE)
  • Facility Location (single and multiple)
  • Reverse Logistics
    • Collection systems: network design and operation
    • Disassembly systems
    • Remanufacturing systems, etc.

    2. Production Planning and Control

    Among various decision problems in production systems, this course considers mainly the inventory and production planning issues in the mathematical aspects
    Included in this course are:

    • Stochastic models with static demand
    • Deterministic models with Static demand
      • Deterministic single-item with static demand
      • Multi-items and constraints
      • Quantity discounts
    • Periodic review and continuous review models
    • Lot sizing problems with dynamic demands
    • Static models basic models and extensions
    • Dynamic models ? basic models and extensions

    3. Scheduling Theory

    Scheduling is the allocation of resources over time to perform a collection of tasks, and scheduling theory is concerned with the development and analysis of mathematical models that generate the best schedule(s) among all others with respect to certain criteria. This course considers the basic scheduling theory, and Included in this course are:

    • Introduction
    • Single machine scheduling - Basic results - General and Special methods - Extensions
    • Parallel machine scheduling - Basic models - Extensions
    • Flow shop scheduling - Basics and Algorithms
    • Job shop scheduling - Basics and Algorithms

    4. Integer & Combinatorial Optimization

    Integer and combinatorial optimization, which is widely used for various linear system optimization problems, deals with the problems of maximizing or minimizing a function of many variables subject to inequality and equality constraints and integrality restrictions on some or all of the variables. The contents are:

  • What is an Integer Program?
  • Formulations (Modeling)
  • Optimality, Relaxations and Bounds
  • Well-solved Problems
  • Matching and Assignments
  • Complexity and Problem Reductions
  • Branch & Bound
  • Cutting Plane Algorithms
  • Strong Valid Inequalities
  • Lagrangian Duality
  • Column Generation Algorithms