<![CDATA[SCL Course: Pre-planning Strategy for Health and Humanitarian Organizations]]> 27233 COURSE DESCRIPTION

Relief requirements for public health and humanitarian events are in general both unknown in size and type, and are affected by dynamic and hard to measure factors such as geographic location, local economy, infrastructure, social and political conditions, etc. Preparing for long-term development and response to emergent events often involves uncertainty in timing, scope, or scale. Pre-planning for these situations requires an understanding of forecasting, distribution network design, and strategies for managing the uncertainty. This course will examine methods and models for making pre-planning decisions and explore the significant value that is obtained through informed decision-making in advance of an unpredictable event.

WHO SHOULD ATTEND

Tactical and strategic members of non-governmental organizations and private corporations involved in the humanitarian relief efforts, U.S. federal government employees, U.S. state or local government employees, humanitarian foundation members, program managers, directors of field operations, disaster relief managers, director of logistics and inventory, and logistics officers

HOW YOU WILL BENEFIT

WHAT IS COVERED

Pre-Course Activities (2.5 hrs) - Online via HELIX platform
Classroom Activities (2 days) - Georgia Tech Global Learning Center

NOTE: Pre-course activities will conducted online using the HELIX online learning management system. Access instructions will be provided to registrants when details become available.

Pre-Course Activities - Conducted online via HELIX
Classroom Activities

Day 1

Day 2

COURSE MATERIALS

Provided

Recommended

 

STUDENT REQUIREMENTS

Students need a laptop with Microsoft Excel and the ability to connect to a high-speed internet connection (internet access is provided for onsite portions of course).

COURSE PREREQUISITES

For those interested in earning the Health and Humanitarian Supply Chain Management Certificate, this course is the first of the three-course certificate program. To earn the certificate, participants must register and complete the following courses within three years:

  1. Pre-planning Strategy for Health and Humanitarian Organizations
  2. Tactical Decision Making in Public Health and Humanitarian Response
  3. Systems Operations in Health and Humanitarian Response

COURSE INSTRUCTORS

Julie SwannOzlem ErgunPinar Keskinocak

 

]]> Andy Haleblian 1 1447775115 2015-11-17 15:45:15 1571662439 2019-10-21 12:53:59 0 0 event During this course, examine methods and models for making preplanning decisions and explore the significant value that is obtained through informed decision-making in advance of an unpredictable event or long-term development.

]]>
2016-05-09T13:30:00-04:00 2016-05-10T22:30:00-04:00 2016-05-10T22:30:00-04:00 2016-05-09 17:30:00 2016-05-11 02:30:00 2016-05-11 02:30:00 2016-05-09T13:30:00-04:00 2016-05-10T22:30:00-04:00 America/New_York America/New_York datetime 2016-05-09 01:30:00 2016-05-10 10:30:00 America/New_York America/New_York datetime <![CDATA[]]> info@scl.gatech.edu

]]>
<![CDATA[Course webpage within the SCL website]]> <![CDATA[Course registration page]]>
<![CDATA[SCL Course: Systems Operations in Health and Humanitarian Response]]> 27233 COURSE DESCRIPTION

Despite having common goals, often the lack of cooperation and coordination between humanitarian organizations results in procurement and allocation inefficiencies. As a result, a systems view of a humanitarian effort is needed to ensure appropriate use of scarce resources to meet the goals at hand. This course will focus on conceptual and modeling skills to understand and effectively manage humanitarian response from a systems perspective. Models will address system characteristics (e.g. demand dependencies) that drive system dynamics and policies to regulate performance. Course topics include methods for improving coordination and collaboration, addressing demand dependencies, and reliably measuring and evaluating system performance.

WHO SHOULD ATTEND

Tactical and strategic members of non-governmental organizations, private corporations involved in the humanitarian relief efforts, U.S. federal government employees, U.S. state or local government employees, humanitarian foundation members, program managers, directors of field operations, disaster relief managers, director of logistics and inventory, and logistics officers

HOW YOU WILL BENEFIT

Upon completion of this course, you will be able to:

WHAT IS COVERED

Pre-Course Activities (5 hrs) - Online via HELIX platform
Classroom Activities (2 days) - Georgia Tech Global Learning Center

NOTE: Pre-course activities will conducted online using the HELIX platform online learning management system. Access instructions will be provided to registrants when details become available.

Pre-Course Activities - Conducted online via HELIX platform

Coordination and Collaboration – 2 hours
Game Theory/Incentives – 1 hour
System Dynamics - 2 hours

Classroom Activities

Day 1

Day 2

Day 3

COURSE MATERIALS

Provided

Recommended

COURSE PREREQUISITES

For those interested in earning the Health and Humanitarian Supply Chain Management Certificate, this course is the third and final of the three-course certificate program. To earn the certificate, participants must register and complete the following courses within three years:

  1. Pre-planning Strategy for Health and Humanitarian Organizations
  2. Tactical Decision Making in Public Health and Humanitarian Response
  3. Systems Operations in Health and Humanitarian Response

COURSE INSTRUCTORS

Julie SwannOzlem ErgunPinar Keskinocak

]]> Andy Haleblian 1 1447776298 2015-11-17 16:04:58 1571662324 2019-10-21 12:52:04 0 0 event Despite having common goals, often the lack of cooperation and coordination between humanitarian organizations results in procurement and allocation inefficiencies. As a result, a systems view of a humanitarian effort is needed to ensure appropriate use of scarce resources to meet the goals at hand. This course will focus on conceptual and modeling skills to understand and effectively manage humanitarian response from a systems perspective.

]]>
2016-05-13T13:30:00-04:00 2016-05-14T22:00:00-04:00 2016-05-14T22:00:00-04:00 2016-05-13 17:30:00 2016-05-15 02:00:00 2016-05-15 02:00:00 2016-05-13T13:30:00-04:00 2016-05-14T22:00:00-04:00 America/New_York America/New_York datetime 2016-05-13 01:30:00 2016-05-14 10:00:00 America/New_York America/New_York datetime <![CDATA[]]> info@scl.gatech.edu

]]>
<![CDATA[Course webpage within the SCL website]]> <![CDATA[Register Online via the GT Professional Education website]]>
<![CDATA[SCL Course: Tactical Decision Making in Public Health and Humanitarian Response]]> 27233 COURSE DESCRIPTION

Numerous tactical decisions must be made in the response to a public health or humanitarian event. Many of these decisions are concerned with the timely and efficient procurement, allocation and distribution of resources (e.g. funds, supplies, volunteers) through a supply chain. This course will explore methodologies for tactical decision making, including procurement and inventory policies, strategies for distribution and allocation of limited resources and transportation decisions.

WHO SHOULD ATTEND

Tactical and strategic members of non-governmental organizations, private corporations involved in the humanitarian relief efforts, U.S. federal government employees, U.S. state or local government employees, humanitarian foundation members, program managers, directors of field operations, disaster relief managers, director of logistics and inventory, and logistics officers

HOW YOU WILL BENEFIT

WHAT IS COVERED

Pre-Course Activities (4.5 hrs) - Online via HELIX platform
Classroom Activities (2.5 days) - Georgia Tech Global Learning Center

NOTE: Pre-course activities will conducted online using the HELIX platform online learning management system. Access instructions will be provided to registrants when details become available.

Pre-Course Activities - Conducted online via HELIX platform

Inventory – 2 hours
Resource Allocation – 1 hour

Classroom Activities

Day 1

Day 2

Day 3

COURSE MATERIALS

Provided

Recommended

STUDENT REQUIREMENTS

Students need a laptop with Microsoft Excel and the ability to connect to a high-speed internet connection (internet access is provided for onsite portions of course).

COURSE PREREQUISITES

For those interested in earning the Health and Humanitarian Supply Chain Management Certificate, this course is the second of the three-course certificate program. To earn the certificate, participants must register and complete the following courses within three years:

  1. Pre-planning Strategy for Health and Humanitarian Organizations
  2. Tactical Decision Making in Public Health and Humanitarian Response
  3. Systems Operations in Health and Humanitarian Response

COURSE INSTRUCTORS

 

Julie SwannOzlem ErgunPinar Keskinocak

]]> Andy Haleblian 1 1447775717 2015-11-17 15:55:17 1571662301 2019-10-21 12:51:41 0 0 event Numerous tactical decisions must be made in the response to a public health or humanitarian event. Many of these decisions are concerned with the timely and efficient procurement, allocation, and distribution of resources (e.g. funds, supplies, volunteers) through a supply chain. This course will explore methodologies for tactical decision making including procurement and inventory policies, strategies for distribution and allocation of limited resources, and transportation decisions.

]]>
2016-05-11T13:30:00-04:00 2016-05-12T22:30:00-04:00 2016-05-12T22:30:00-04:00 2016-05-11 17:30:00 2016-05-13 02:30:00 2016-05-13 02:30:00 2016-05-11T13:30:00-04:00 2016-05-12T22:30:00-04:00 America/New_York America/New_York datetime 2016-05-11 01:30:00 2016-05-12 10:30:00 America/New_York America/New_York datetime <![CDATA[]]> info@scl.gatech.edu

]]>
<![CDATA[Course webpage within the SCL website]]> <![CDATA[Register Online via the GT Professional Education website]]>
<![CDATA[2016 ISyE Distinguished Scholarship Lecture - Edward H. Kaplan ]]> 28766 ISyE Distinguished Scholarship Lecture - Edward H. Kaplan

ISyE Hosts Yale University's Edward H. Kaplan for its Distinguished Scholarship Lecture on Monday, March 28, 2016. It will take place in the Molecular Science and Engineering Building Auditorium, Cherry Logan Emerson Lecture Theater from 3 p.m. - 4 p.m. A reception will immediately follow the lecture.

Kaplan is William N. and Marie A. Beach Professor of Operations Research, Professor of Public Health, and Professor of Engineering at Yale University, as well as president of INFORMS.

He will be speaking on "Adventures in Policy Modeling!" Policy modeling refers to the application of operations research, statistics, and other quantitative methods to model policy problems. Recognizing that analyses of all sorts often exhibit diminishing returns in insight to effort, the hope is to capture key features of various policy issues with relatively simple “first-strike” models. Problem selection and formulation thus compete with the mathematics of solution methods in determining successful applications: Where do good problems come from? How can analysts tell if a particular issue is worth pursuing?

In addressing these questions, Dr. Kaplan will review some personal adventures in policy modeling selected from public housing, HIV/AIDS prevention, bioterror preparedness, suicide bombings and counterterrorism, in vitro fertilization, predicting presidential elections, and sports.

]]> Shelley Wunder-Smith 1 1455814185 2016-02-18 16:49:45 1533661787 2018-08-07 17:09:47 0 0 event 2016-03-28T16:00:00-04:00 2016-03-28T17:00:00-04:00 2016-03-28T17:00:00-04:00 2016-03-28 20:00:00 2016-03-28 21:00:00 2016-03-28 21:00:00 2016-03-28T16:00:00-04:00 2016-03-28T17:00:00-04:00 America/New_York America/New_York datetime 2016-03-28 04:00:00 2016-03-28 05:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[Home Delivery World 2016, Click & Collect, ECommerce Show, Retail Technology Show]]> 27233 SCL is serving as the official Education and Research Partner with our own Tim Brown serving as chairman of this year's conference. A number of our faculty and students will also be engaged in the conference – which takes place downtown on March 30 and 31 with 1,200 attendees.

For 2016, Home Delivery World will be joined by and co-located with Click & Collect USA, ECommerce Show USA, and Retail Technology Show USA March 30-31 at the Atlanta Convention Center at AmericasMart. The events are open to anyone and "Exhibition-only" passes are free. See the respective websites for other options and program details.

Georgia Tech Students!

A limited number of "All Access" passes will be made available to students in exchange for a day of blogging (grants access to activities in addition to the expo…stop by the SCL suite - Groseclose 228 or email event@scl.gatech.edu for more information).

Home Delivery World 2016
The USA's only event for the entire home delivery chain

If you deal or are interested in home delivery, you've been discussing topics like reverse logistics, direct fulfillment, multichannel returns, real-time visibility for inventory, and international expansion.

At the Home Delivery World USA 2016 in Atlanta this March, we give you the perfect opportunity to meet, learn, and network with retailers, grocers, e-tailers, marketplaces, and the leading companies and solution providers in the space.

Learn More | Register to Attend

Click & Collect Show USA 2016
The leading click and collect event

The Click & Collect Show USA is the first and only event in the US market to gather the heads of delivery operations from the major retailers in the world to discuss how Click & Collect will shape the way consumers collect their goods, either in store or by driving to a collection point.You can choose between visiting the expo and on-floor seminars as a visitor, or registering to attend the full VIP conference.

From in-store pickup to drive thru, lockers, and kiosks approaches, Click & Collect examines the strategies that retailers and carriers are starting to roll out in the US market and that may change the entire home delivery chain.

Learn More | Register to Attend

ECommerce Show USA 2016

If you're a professional who deals in the online world, you know that keeping up with innovations in ecommerce is crucial. This is a space where getting left behind is not an option.

At the Ecommerce Show USA 2016 in Atlanta this March, we give you the perfect opportunity to stay ahead of the curve by putting you in the same room with leading etailers like Jet.com, Etsy, Fanatics, and leading ecommerce platforms.

Learn More | Register to Attend

Retail Technology Show USA 2016

The inaugural Retail Technology Show USA will bring together retailers to discuss the latest retail technology innovation and strategies.

This event will be combined with the ECommerce Show USA, Click & Collect and Home Delivery World to address new models of crowd-sourced delivery, lockers, customer care, retention, personalization, and new customer experience strategies. Retailers looking to learn all they need to know to enhance their delivery and eCommerce programs all in one place choose the right event when signing up for Retail Technology Show USA.

Learn More | Register to Attend

About Attending

Attend any of the above expos for FREE. With our FREE Visitor Pass, you will have the opportunity to meet, learn, and network anywhere on our expo floor. Leading retailers, etailers, and grocers from across the globe will be there!

If you would like to attend the additional seminars and conference events not included in the expo, please see each respective conference website. Discounts for the full conference are available for groups of 3 or more - for more information please send an email to william.horgan@terrapinn.com or +1 212 379 6320.

]]> Andy Haleblian 1 1456925099 2016-03-02 13:24:59 1492118185 2017-04-13 21:16:25 0 0 event For 2016, Home Delivery World will be joined by and co-located with Click & Collect USA, Etail Show USA, and Retail Technology Show USA March 30-31 at the Atlanta Convention Center at AmericasMart. The events are open to anyone and "Exhibition-only" passes are free. See the respective websites for other options and program details.

]]>
2016-03-30T09:00:00-04:00 2016-03-31T18:00:00-04:00 2016-03-31T18:00:00-04:00 2016-03-30 13:00:00 2016-03-31 22:00:00 2016-03-31 22:00:00 2016-03-30T09:00:00-04:00 2016-03-31T18:00:00-04:00 America/New_York America/New_York datetime 2016-03-30 09:00:00 2016-03-31 06:00:00 America/New_York America/New_York datetime <![CDATA[]]> Discounts for the full conference are available for groups of 3 or more - for more information please send an email to william.horgan@terrapinn.com or +1 212 379 6320.

]]>
508431 508431 image <![CDATA[HomeDelivery_200x200]]> image/png 1457114400 2016-03-04 18:00:00 1475895270 2016-10-08 02:54:30 <![CDATA[Home Delivery World 2016]]> <![CDATA[Click & Collect USA 2016]]> <![CDATA[ECommerce Show USA 2016]]> <![CDATA[Retail Technology Show USA 2016]]>
<![CDATA[ISyE Seminar - Sam Burer]]> 27187 TITLE:  A Copositive Approach for Two-Stage Adjustable Robust Optimization with Uncertain Right-Hand Sides

(Joint with Guanglin Xu)

Abstract: 

We study two-stage adjustable robust linear programming in which the right-hand sides are uncertain and belong to a convex, compact uncertainty set. This problem is NP-hard, and the affine policy is a popular, tractable approximation. We prove that under standard and simple conditions, the two-stage problem can be reformulated as a copositive optimization problem, which in turn leads to a class of tractable, semidefinite-based approximations that are at least as strong as the affine policy. We investigate several examples from the literature demonstrating that our tractable approximations significantly improve the affine policy. In particular, our approach solves exactly in polynomial time a class of instances of increasing size for which the affine policy admits an arbitrarily large gap.

 

Bio:

Sam Burer is George Daly Professor and Graduate Business Analytics Director in the Department of Management Sciences at the University of Iowa. He received his Ph.D. from the Georgia Institute of Technology, and his professional interests include analytics, operations research, management sciences, and optimization. His research has been supported by grants from the National Science Foundation, and he serves on the editorial boards of Management Sciences, Operations Research, SIAM Journal on Optimization, and Mathematics of Operations Research. He has also served as a Member of the Board of Directors of the INFORMS Computing Society and as a Council Member of the Mathematical Optimization Society.

]]> Anita Race 1 1472725153 2016-09-01 10:19:13 1492118091 2017-04-13 21:14:51 0 0 event 2016-10-19T16:00:00-04:00 2016-10-19T16:00:00-04:00 2016-10-19T16:00:00-04:00 2016-10-19 20:00:00 2016-10-19 20:00:00 2016-10-19 20:00:00 2016-10-19T16:00:00-04:00 2016-10-19T16:00:00-04:00 America/New_York America/New_York datetime 2016-10-19 04:00:00 2016-10-19 04:00:00 America/New_York America/New_York datetime <![CDATA[]]> Renato Monteiro/Andy Sun

]]>
<![CDATA[ISyE Seminar - Sasha Rakhlin]]> 27187 TITLE:  Online Prediction: A Marriage of Optimization and Probability

ABSTRACT:

The talk will focus on two seemingly unrelated topics: (i) existence of prediction strategies that have a performance guarantee for all sequences and (ii) probabilistic inequalities for martingales. We will point to a certain equivalence between these two topics, with the most basic example going back to the work of T. Cover in 1965. In light of the equivalence, we will develop computationally efficient prediction methods for problems with a combinatorial benchmark, even when estimating the correct model is NP-hard. Exploiting the equivalence in the other direction, we show that tail bounds for a certain ratio-type inequality follow with ease from mirror descent with an adaptive step size.

Joint work with K. Sridharan

Bio:  Alexander (Sasha) Rakhlin is an Associate Professor of Statistics at the University of Pennsylvania, The Wharton School. He received his Bachelors from Cornell University, a Ph.D. from MIT, and joined Penn after working as a postdoctoral researcher at UC Berkeley. Sasha’s interests span a range of topics, including statistics, machine learning, online prediction, and optimization.

]]> Anita Race 1 1472725312 2016-09-01 10:21:52 1492118091 2017-04-13 21:14:51 0 0 event 2016-11-02T16:00:00-04:00 2016-11-02T16:00:00-04:00 2016-11-02T16:00:00-04:00 2016-11-02 20:00:00 2016-11-02 20:00:00 2016-11-02 20:00:00 2016-11-02T16:00:00-04:00 2016-11-02T16:00:00-04:00 America/New_York America/New_York datetime 2016-11-02 04:00:00 2016-11-02 04:00:00 America/New_York America/New_York datetime <![CDATA[]]> Arkadi Nemirovski

]]>
<![CDATA[ISyE Seminar - Margaret Brandeau]]> 27187 TITLE: What Should We Do About Drug Abuse? Models to Support Good Decisions

ABSTRACT:

The US is currently experiencing an epidemic of drug abuse caused by prescription opioids and illegal opioid use, including heroin. In addition to crime and social problems, rising levels of drug abuse have led to a sharp increase in overdose deaths in the US as well as significant outbreaks of infectious diseases such as HIV and hepatitis C. How should we deploy limited public health resources to help solve this problem? This talk describes models used to support decision making regarding controlling drug abuse – and associated diseases such as HIV and hepatitis C – in the US. We describe models to evaluate the effectiveness and cost-effectiveness of HIV and drug abuse prevention programs targeted to injection drug users; health impacts of diversion programs for low-level drug offenders; and health impacts of current and potential future opioid prescribing practices in the US. We conclude with a discussion of promising directions for further research.

Bio: Margaret L. Brandeau is Coleman F. Fung Professor of Engineering and Professor of Medicine (by Courtesy) at Stanford University. Her research focuses on the development of applied mathematical and economic models to support health policy decisions. Her recent work has examined HIV and drug abuse prevention and treatment programs, programs to control the spread of hepatitis B virus, and preparedness plans for bioterror response. She is a Fellow of INFORMS and a member of the Omega Rho Honor Society for Operations Research and Management Science. From INFORMS, she has received the Philip McCord Morse Lectureship Award, the President’s Award, the Pierskalla Prize, and the Award for the Advancement of Women in Operations Research and the Management Sciences. She has also received the Award for Excellence in Application of Pharmacoeconomics and Health Outcomes Research from the International Society for Pharmacoeconomics and Outcomes Research (ISPOR) and a Presidential Young Investigator Award from the National Science Foundation, among other awards. Professor Brandeau earned a BS in Mathematics and an MS in Operations Research from MIT, and a Ph.D. in Engineering-Economic Systems from Stanford.

]]> Anita Race 1 1472725392 2016-09-01 10:23:12 1492118091 2017-04-13 21:14:51 0 0 event 2016-11-09T16:00:00-05:00 2016-11-09T17:00:00-05:00 2016-11-09T17:00:00-05:00 2016-11-09 21:00:00 2016-11-09 22:00:00 2016-11-09 22:00:00 2016-11-09T16:00:00-05:00 2016-11-09T17:00:00-05:00 America/New_York America/New_York datetime 2016-11-09 04:00:00 2016-11-09 05:00:00 America/New_York America/New_York datetime <![CDATA[]]> Turgay Ayer

]]>
<![CDATA[ISyE Seminar - Sid Banerjee]]> 27187 TITLE: Pricing and Optimization in Shared Vehicle Systems

ABSTRACT:

Shared vehicle systems, such as those for bike-sharing (e.g., Citi Bike in NYC, Velib in Paris), car-sharing (e.g., car2go, Zipcar) and ride-sharing (Uber, Lyft, etc.) are fast becoming essential components of the urban transit infrastructure. The technology behind these platforms enable fine-grained monitoring and control tools, including good demand forecasts, accurate vehicle-availability information, and the ability to do dynamic pricing and vehicle repositioning. However, owing to their on-demand nature and the presence of network externalities (wherein setting prices at one place affects the supply at all other locations), optimizing the operations of such systems is challenging. To this end, I will describe how such systems can be modeled using queueing-network models, and talk about two recent projects in which we have developed the theoretical tools for analyzing such systems.

 

First, I will present a unifying framework for data-driven pricing and optimization in shared vehicle systems. Our approach provides efficient algorithms with rigorous approximation guarantees under a variety of controls (pricing, empty-vehicle repositioning, demand redirection) and for a wide class of objective functions (including welfare and revenue, and also multi-objective problems such as Ramsey pricing). Next, using the particular example of dynamic pricing in ride-sharing platforms, I will discuss how market mechanisms can help us to go beyond data-driven optimization; in particular, I will show how dynamic pricing is not any better than static pricing in general, but rather, how it allows the platform to realize optimal performance with limited knowledge of system parameters.

 

Based on joint work with Ramesh Johari and Carlos Riquelme at Stanford, Daniel Freund and Thodoris Lykouris at Cornell, and the data science team at Lyft.

]]> Anita Race 1 1472725540 2016-09-01 10:25:40 1492118091 2017-04-13 21:14:51 0 0 event 2016-12-07T16:00:00-05:00 2016-12-07T17:00:00-05:00 2016-12-07T17:00:00-05:00 2016-12-07 21:00:00 2016-12-07 22:00:00 2016-12-07 22:00:00 2016-12-07T16:00:00-05:00 2016-12-07T17:00:00-05:00 America/New_York America/New_York datetime 2016-12-07 04:00:00 2016-12-07 05:00:00 America/New_York America/New_York datetime <![CDATA[]]> Dave Goldberg

]]>
<![CDATA[SCL Course: Best Practices in Contract Development and Management]]> 27233 Course Description

High quality contract development and management tools are essential activities in achieving improved levels of performance for all Procurement and Supply Management practitioners. Providing robust contracts and process oversight for your organization is critical for success in the Procurement and Supply Management profession.

Experienced professionals involved in supplier bidding, supplier selection, and contract preparation activities usually have a good understanding of key contractual terms applicable and the appropriate contract type needed for the job. Therefore, this program is designed to increase the contracting preparation and execution competencies of practitioners focusing on contractual terms, types, and structure.

All in all, Best Practices in Contract Development and Management will better prepare practitioners for driving cost savings and mitigating supplier risk through contracting activity. This course is perfect for practitioners responsible for acquisition of materials, labor, equipment and/or professional services.

Who Should Attend

Category management and strategic sourcing professionals, business unit manager, procurement and purchasing professionals and supply chain management professionals

How You Will Benefit

Participants who successfully complete this course will:

  • Understand the key aspects of the contracting process and be able to manage contract documents
  • Learn the essential elements of a contract and the key forms of contracts used in procurement
  • Understand commercial risks associated with the bidding and contracting process
  • Learn the key standard contact terms and conditions
  • Be exposed to the key contracting strategies
  • Understand the types, and importance of, commercial contract clauses
  • Understand basic principles in contract formation
  • Understand contracting controls and management
  • Be exposed to the various legal aspects of contracting
  • Appreciate the advantages and disadvantages of using short-term contracts
  • Appreciate the advantages and disadvantages of using longer-term contracts
  • Understand the requirements for and process of incorporating and managing risk in contracting including how to transfer risk through the use of various contract types
  • Understand the conventions that address the legal aspects of international contracting including the Convention on the International Sale of Goods (CISG)
  • Understand contract development and management best practices

What Is Covered

Day 1: 8am – 5pm
8am – 12pm (includes 2, 15-minute breaks)
  • Understanding of Contract Law and Legal Aspects
  • Common Agreement Types
  • Contract Framework & Terminology
  • Managing Risk
12pm – 1 pm Lunch
1-5 pm (Includes 2 15-minute breaks)
  • Contract Structure & Development
  • Contract Award Preparation & Management
  • Supplier Selection Overview
  • Performance Monitoring

Course Materials

Participants receive a course notebook (i.e. slides, notes, exercises).

Course Prerequisite and Related Certificate Information

No prerequisites. This course can be used as an elective towards our Supply Chain Management (SCM) certificate.

Course Instructors

Sean WilliamsAndrew Kwok

Course Fees

Standard: $950.00, Alumni/Org Discount: $855.00, Certificate: $807.50 (cost of each course when signing up for and paying for a multi-course certificate program).

First time attendees pay the listed course fee. If you are a returning student of the Supply Chain & Logistics Institute (SCL) courses, you will receive a 10% discount which you will enter at the "Check Out" page. Use Coupon Code SCL-Alum.

There are also discounts available for multiple-team member registrations, to those who prepay for all the courses in a specific certificate, to active/retired military, or to members of certain organizations (click this link for a listing).

Discounts cannot be combined. To receive the coupon code for these discounts, call 404-385-8663 or send us an email prior to registration

The program fee for LIVE courses (non-online) includes continental breakfasts, lunches, breaks, parking, internet access, and all classroom materials.

If the Supply Chain & Logistics Institute must cancel a program, registrants will receive a full refund. Georgia Tech, however, cannot assume the responsibility for other costs incurred. Due to program enrollment limits, early registration is encouraged. Registrations will be acknowledged by a letter of confirmation from Professional Education.

Course Times

Please check in at least 30 minutes before the class start time.

  • First/Only Day - 8:00am to 5:00pm

Every effort is made to present the course as advertised herein; however, circumstances may make it necessary to alter the schedule and/or presenters.

]]> Andy Haleblian 1 1475078026 2016-09-28 15:53:46 1492118070 2017-04-13 21:14:30 0 0 event Experienced professionals involved in supplier bidding, supplier selection, and contract preparation activities usually have a good understanding of key contractual terms applicable and the appropriate contract type needed for the job. Therefore, this program is designed to increase the contracting preparation and execution competencies of practitioners focusing on contractual terms, types, and structure.

]]>
2016-11-07T09:00:00-05:00 2016-11-07T18:00:00-05:00 2016-11-07T18:00:00-05:00 2016-11-07 14:00:00 2016-11-07 23:00:00 2016-11-07 23:00:00 2016-11-07T09:00:00-05:00 2016-11-07T18:00:00-05:00 America/New_York America/New_York datetime 2016-11-07 09:00:00 2016-11-07 06:00:00 America/New_York America/New_York datetime <![CDATA[Mitsubishi-Hitachi Power System America (MHPS)]]> REGISTRATION
  • ON-LINE: Register Online via the GT Professional Education website.
  • FAX: Send the registration form along with your credit card information to (404) 894-8925. This line is available 24 hours a day.
  • MAIL:
    Georgia Institute of Technology
    Professional Education—R
    P.O. Box 93686
    Atlanta, Georgia
    30377-0686
  • CALL: (404) 385-3501 between 9:00a.m. and 4:00p.m., Eastern time. Have your credit card and registration form handy to aid in this process.
]]>
<![CDATA[Course registration via GT Professional Education website]]> <![CDATA[Visit the course page within the SCL website.]]> <![CDATA[Course Flyer]]>
<![CDATA[BSIE/MS SCE Information Session ]]> 27187 Thursday, October 20, 2016 | 11:05am - 11:55am | ISyE Groseclose, room 402 (4th floor)

ISyE now has a BS/MS option for undergraduates where students may earn a BSIE and an MS Supply Chain Engineering (MSSCE) degree in 5 total years.  We currently have 10-15 BSIE students in the program, intending to complete both degrees in 2017 or 2018. 

Students admitted to the program transfer from undergraduate status to graduate status after fulfilling BSIE degree requirements at the end of a Fall semester, and must apply to the program either 1 year or 2 years prior to entering semester.  Admitted students may begin taking graduate classes during the following Fall semester.  Applications to the program are opening this week for students interested in completing the program in 2018 and 2019, and the application site will remain open until February 15, 2017.  We seek strong students who meet Georgia Tech requirements for taking graduate classes while at the undergraduate level, and who are very interested in careers in the supply chain domain.

]]> Anita Race 1 1476385743 2016-10-13 19:09:03 1492118059 2017-04-13 21:14:19 0 0 event 2016-10-20T12:00:00-04:00 2016-10-20T13:00:00-04:00 2016-10-20T13:00:00-04:00 2016-10-20 16:00:00 2016-10-20 17:00:00 2016-10-20 17:00:00 2016-10-20T12:00:00-04:00 2016-10-20T13:00:00-04:00 America/New_York America/New_York datetime 2016-10-20 12:00:00 2016-10-20 01:00:00 America/New_York America/New_York datetime <![CDATA[]]> Dimetra Diggs-Butler  dimetra.diggs-butler@isye.gatech.edu

]]>
<![CDATA[SCL November 2016 Supply Chain Day]]> 27233 Supply Chain students, please join us for our second Supply Chain Day of the semester! The 3-hour session will host supply chain representatives from APICS, Ajilon Professional Staffing, AmazonFortna​, Llamasoft, Logility, ​Manhattan Associates, Schneider Electric, Scott Logistics, and ​Smith & Nephew who will be on campus to educate ISyE students about their organizations and available employment and networking opportunities.

We strongly encourage students to act now to seek full-time employment, internships, and projects (rather than waiting until the end of the semester). Plus, enjoy a free pizza lunch!

EVENT DETAILS

Where: ISyE Main Bldg, 2nd Floor Atrium

When: Wednesday, November 9, 10:30AM-1:30PM

What: The session will include:

Please plan on staying for the duration of the event and bring copies of your resume and business cards. Dress is business casual.

REGISTER ONLINE by November 4!

EVENT SPONSOR

The event is sponsored through the generosity and support of APICS - Atlanta Chapter. APICS is a non-profit educational organization addressing operations management and supply chain management issues, and providing professional development opportunities to its members. APICS Membership is free for full time students. Join today at www.apics.org/join and start networking at local APIC Atlanta events. Also make sure to stop by the APICS table at the event.

]]> Andy Haleblian 1 1476718157 2016-10-17 15:29:17 1492118057 2017-04-13 21:14:17 0 0 event Supply Chain students, please join us for our second Supply Chain Day of the semester! The 3-hour session will host supply chain representatives from APICS, Ajilon Professional Staffing, Amazon, Fortna​, Llamasoft, Logility, ​Manhattan Associates, Schneider Electric, Scott Logistics, and ​Smith & Nephew who will be on campus to educate ISyE students about their organizations and available employment and networking opportunities.

 

]]>
2016-11-09T11:30:00-05:00 2016-11-09T14:30:00-05:00 2016-11-09T14:30:00-05:00 2016-11-09 16:30:00 2016-11-09 19:30:00 2016-11-09 19:30:00 2016-11-09T11:30:00-05:00 2016-11-09T14:30:00-05:00 America/New_York America/New_York datetime 2016-11-09 11:30:00 2016-11-09 02:30:00 America/New_York America/New_York datetime <![CDATA[]]> event@scl.gatech.edu

]]>
582652 582652 image <![CDATA[SCL November 2016 Supply Chain Day]]> image/png 1476718065 2016-10-17 15:27:45 1478624359 2016-11-08 16:59:19 <![CDATA[Register online to attend (for supply chain students)]]> <![CDATA[About Supply Chain Day]]> <![CDATA[Supply Chain & Logistics Institute website]]>
<![CDATA[DOS Seminar - Fabian Rigterink]]> 27187 TITLE: On the strength of relaxations of the boolean quadric polytope

ABSTRACT:

In the 1989 seminal paper, The boolean quadric polytope: Some characteristics, facets and relatives [Mathematical Programming, 45(1-3):139-172, 1989], Padberg introduced five classes of valid inequalities for the boolean quadric polytope: triangle, clique, cut, generalized cut, and odd cycle inequalities. In addition to the McCormick relaxation, these inequalities give a stronger relaxation of the convex hull of the graph of a bilinear function. In this talk, we study classes of bilinear functions where the McCormick relaxation and some of the Padberg inequalities characterize the convex hull. Furthermore, we study which of the Padberg inequalities give the strongest relaxation of the convex hull. We then apply the strong inequalities to (quadratically constrained) quadratic programs from the literature to find good lower bounds fast. Finally, we demonstrate that warm starting a global optimization solver with these lower bounds can improve the solver's performance.

This is joint work with Natashia Boland, Thomas Kalinowski, and Hamish Waterer.

]]> Anita Race 1 1477064216 2016-10-21 15:36:56 1492118053 2017-04-13 21:14:13 0 0 event 2016-10-25T12:00:00-04:00 2016-10-25T13:00:00-04:00 2016-10-25T13:00:00-04:00 2016-10-25 16:00:00 2016-10-25 17:00:00 2016-10-25 17:00:00 2016-10-25T12:00:00-04:00 2016-10-25T13:00:00-04:00 America/New_York America/New_York datetime 2016-10-25 12:00:00 2016-10-25 01:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[Statistics Seminar - Jeff Wu]]> 27187 TITLE: A fresh look at effect aliasing and interactions: some new wine in old bottles

ABSTRACT:

Interactions and effect aliasing are among the fundamental concepts in experimental design. Some new insight and approach are given on this time honored subject.  Start with the very simple two-level fractional factorial designs. Two interactions AB and CD are said to be aliased if both represent and are used to estimate the same effect. In the literature this aliasing is deemed impossible to be “de-aliased” or estimated. We argue that this “impossibility” can indeed be resolved by taking a new approach which consists of reparametrization using the notion of “conditional main effects” (cme’s) and model selection by exploiting the properties between the cme’s and traditional factorial effects. In some sense this is a shocking result as this has been taken for granted since the founding work of Finney (1945). There is a similar surprise for three-level fractional factorial designs. The standard approach is to use ANOVA to decompose the interactions into orthogonal components, each of 2-d. Then the quandary of full aliasing between interaction components remains. Again this can be resolved by using a non-orthogonal decomposition of the four degrees of freedom for AxB interaction using the linear-quadratic parametrization. Then a model search strategy would allow the estimation of some interaction components even for designs of resolution III and IV. Moving from regular to nonregular designs like the Plackett-Burman designs, most of the interactions are not orthogonal to the main effects. The partial aliasing of the effects and their complexity was traditionally viewed as “hazards”. Hamada and Wu (1992)  recognized that this could be turned into an advantage. Their analysis strategy for effect de-aliasing is a precursor to what was described above. Underlying the three problems is the use of reparametrization and exploitation of non-orthogonality among some effects. The stated approach can be extended beyond designed experiments and potential applications in machine learning will be outlined.

(This internal talk is a repeat of the Akaike Memorial Lecture I gave on September 5 in Kanazawa, Japan.)

]]> Anita Race 1 1477329998 2016-10-24 17:26:38 1492118053 2017-04-13 21:14:13 0 0 event 2016-10-25T12:00:00-04:00 2016-10-25T13:00:00-04:00 2016-10-25T13:00:00-04:00 2016-10-25 16:00:00 2016-10-25 17:00:00 2016-10-25 17:00:00 2016-10-25T12:00:00-04:00 2016-10-25T13:00:00-04:00 America/New_York America/New_York datetime 2016-10-25 12:00:00 2016-10-25 01:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[DOS Seminar - Huan Xu]]> 27187 TITLE: Goal Scoring, Coherent Loss, and Application to Machine Learning

ABSTRACT:

Motivated by the binary classification problem in machine learning, we study a class of decision problems where the decision maker has a list of goals, from which he aims to attain the maximal possible number of goals. In binary classification, this essentially means seeking a prediction rule to achieve the lowest probability of misclassification, and computationally it involves minimizing a (difficult) non-convex, 0-1 loss function. To address the intractability, previous methods consider minimizing the cumulative loss – the sum of convex surrogates of the 0-1 loss of each goal. We revisit this paradigm and develop instead an axiomatic framework by proposing a set of salient properties on functions for goal scoring and then propose the coherent loss approach, which is a tractable upper-bound of the loss over the entire set of goals. We show that the proposed approach yields a strictly tighter approximation to the total loss (i.e., the number of missed goal) than any convex cumulative loss approach while preserving the convexity of the underlying optimization problem. Moreover, this approach, applied to for binary classification, also has a robustness interpretation which builds a connection to robust SVMs.

Bio:  Dr. Huan Xu is an assistant professor at the Stewart School of Industrial & Systems Engineering at Georgia Tech. His current research interest focuses on data, learning, and decision making. Specifically, he is interested in machine learning, high-dimensional statistics, robust and stochastic optimization, sequential decision making, and application to large-scale systems.

 

]]> Anita Race 1 1477483267 2016-10-26 12:01:07 1492118049 2017-04-13 21:14:09 0 0 event 2016-11-01T15:00:00-04:00 2016-11-01T16:00:00-04:00 2016-11-01T16:00:00-04:00 2016-11-01 19:00:00 2016-11-01 20:00:00 2016-11-01 20:00:00 2016-11-01T15:00:00-04:00 2016-11-01T16:00:00-04:00 America/New_York America/New_York datetime 2016-11-01 03:00:00 2016-11-01 04:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[SIAC/Statistics Seminar - William H. Woodall]]> 27187 TITLE: The Monitoring of Surgical Outcome Quality

ABSTRACT:

Some statistical issues related to the monitoring of surgical outcome quality will be reviewed in this presentation. The important role of risk-adjustment in healthcare, used to account for variations in the health conditions of patients, will be described. Several of the methods for monitoring outcome quality over time, including a new one, will be outlined and illustrated with examples. The advantages of using the conditional false alarm rate metric will be emphasized.
 
References:
Steiner, S. H. and Woodall, W. H. (2016). “Debate: What is the Best Method to Monitor Surgical Performance?”, BMC Surgery. 16:15 DOI 10.1186/s12893-016-0131-8.
Woodall, W. H., Fogel, S. L., and Steiner, S. H. (2015). “The Monitoring and Improvement of Surgical Outcome Quality”. Journal of Quality Technology 47(4), 383-399.
Zhang, X. and Woodall, W. H. (2015). “Dynamic Probability Control Limits for Risk-adjusted Bernoulli CUSUM Charts”. Statistics in Medicine 34, 3336-3348.

Bio:

William H. Woodall, Professor of Statistics at Virginia Tech, is a former editor of the Journal of Quality Technology (2001–2003) and Associate Editor of Technometrics (1987–1995; 2013). He has published well over 140 papers, most on aspects of process monitoring and health-related surveillance. He is the recipient of the ASQ Shewhart Medal (2002), ENBIS Box Medal (2012), Jack Youden Prize (1995, 2003), ASQ Brumbaugh Award (2000, 2006), Ellis Ott Foundation Award (1987), Soren Bisgaard Award (2012), Lloyd S. Nelson Award (2014), and a best paper award from IIE Transactions on Quality and Reliability Engineering (1997). He is a Fellow of the American Statistical Association, a Fellow of the American Society for Quality, and an elected member of the International Statistical Institute.

]]> Anita Race 1 1477915428 2016-10-31 12:03:48 1492118048 2017-04-13 21:14:08 0 0 event 2016-11-03T12:00:00-04:00 2016-11-03T13:00:00-04:00 2016-11-03T13:00:00-04:00 2016-11-03 16:00:00 2016-11-03 17:00:00 2016-11-03 17:00:00 2016-11-03T12:00:00-04:00 2016-11-03T13:00:00-04:00 America/New_York America/New_York datetime 2016-11-03 12:00:00 2016-11-03 01:00:00 America/New_York America/New_York datetime <![CDATA[]]> Kamran Paynabar

]]>
<![CDATA[DOS Seminar - William Haskell]]> 27187 TITLE: Online algorithms for constrained optimization

ABSTRACT:

Much of the literature on online optimization focuses on unconstrained minimization of objective functions with a large number of terms.  We are interested in extending this development to create online algorithms for convex optimization problems with large numbers of constraints.  We offer two approaches in this regard.  First, we combine random constraint sampling with the classical primal-dual algorithm.  Second, we combine random constraint sampling with classical penalty/barrier methods.  We are able to give a convergence rate analysis for both approaches.

 

Bio

William B. Haskell completed his Ph.D in operations research at the University of California Berkeley in 2011.  He is currently an assistant professor in the Department of Industrial and Systems Engineering at the National University of Singapore. His research focuses on large-scale decision-making, and he has a special interest in risk-aware sequential optimization.

]]> Anita Race 1 1478185536 2016-11-03 15:05:36 1492118044 2017-04-13 21:14:04 0 0 event 2016-11-10T12:00:00-05:00 2016-11-10T12:00:00-05:00 2016-11-10T12:00:00-05:00 2016-11-10 17:00:00 2016-11-10 17:00:00 2016-11-10 17:00:00 2016-11-10T12:00:00-05:00 2016-11-10T12:00:00-05:00 America/New_York America/New_York datetime 2016-11-10 12:00:00 2016-11-10 12:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[ISyE Seminar - Laurence Wolsey]]> 27187 TITLE: Projection of Shortest Path Extended Formulations

ABSTRACT:

Several important subproblems, such as switching machines on and off, finding an optimal convex set in 2-D, or buying and selling of a commodity, can be formulated as shortest/longest path problems in an acyclic graph. The corresponding polyhedron provides an implicit polynomial size description of the convex hull of solutions. A natural question is whether one can find a similar description in the original variables of the problem. In this talk we present several examples, each time using a different technique to obtain the projection. This is in large part joint work with Maurice Queyranne. 

]]> Anita Race 1 1478535704 2016-11-07 16:21:44 1492118044 2017-04-13 21:14:04 0 0 event 2016-11-11T14:00:00-05:00 2016-11-11T15:00:00-05:00 2016-11-11T15:00:00-05:00 2016-11-11 19:00:00 2016-11-11 20:00:00 2016-11-11 20:00:00 2016-11-11T14:00:00-05:00 2016-11-11T15:00:00-05:00 America/New_York America/New_York datetime 2016-11-11 02:00:00 2016-11-11 03:00:00 America/New_York America/New_York datetime <![CDATA[]]> Santanu Dey  santanu.dey@isye.gatech.edu

]]>
<![CDATA[Statistics Seminar - Youssef Marzouk]]> 27187 TITLE:  Measure transport approaches for Bayesian computation

ABSTRACT:

We will discuss how transport maps, i.e., deterministic couplings between probability measures, can enable useful new approaches to Bayesian computation. A first use involves a combination of optimal transport and Metropolis correction; here, we use continuous transportation to transform typical MCMC proposals into adapted non-Gaussian proposals, both local and global. Second, we discuss a variational approach to Bayesian inference that constructs a deterministic transport map from a reference distribution to the posterior, without resorting to MCMC. Independent and unweighted samples can then be obtained by pushing forward reference samples through the map.

 

Making either approach efficient in high dimensions, however, requires identifying and exploiting low-dimensional structure. We present new results relating the sparsity and decomposability of transports to the conditional independence structure of the target distribution. We also describe conditions, common in inverse problems, under which transport maps have a particular low-rank or near-identity structure. In general, these properties of transports can yield more efficient algorithms. As a particular example, we derive new deterministic "online" algorithms for Bayesian inference in nonlinear and non-Gaussian state-space models with static parameters. 

This is joint work with Daniele Bigoni, Matthew Parno, and Alessio Spantini.

 

]]> Anita Race 1 1478543676 2016-11-07 18:34:36 1492118044 2017-04-13 21:14:04 0 0 event 2016-11-10T12:00:00-05:00 2016-11-10T13:00:00-05:00 2016-11-10T13:00:00-05:00 2016-11-10 17:00:00 2016-11-10 18:00:00 2016-11-10 18:00:00 2016-11-10T12:00:00-05:00 2016-11-10T13:00:00-05:00 America/New_York America/New_York datetime 2016-11-10 12:00:00 2016-11-10 01:00:00 America/New_York America/New_York datetime <![CDATA[]]> Ben Haaland  bhaaland3@gatech.edu

]]>
<![CDATA[DOS Seminar - Ignacio Aravena]]> 27187 TITLE:  An Asynchronous Distributed Algorithm for Solving Stochastic Unit Commitment

ABSTRACT:

We present an asynchronous algorithm for solving the stochastic unit commitment (SUC) problem using scenario decomposition. The algorithm is motivated by the scale of problem and significant differences in run times observed among scenario subproblems, which can result in inefficient use of distributed computing resources by synchronous parallel algorithms. Dual iterations are performed asynchronously using a block-coordinate subgradient descent method which allows performing block-coordinate updates using delayed information. We provide convergence guarantees for the asynchronous block-coordinate subgradient method based on previous results for incremental subgradient methods and stochastic subgradient methods. The algorithm recovers candidate primal solutions from the solutions of scenario subproblems using recombination heuristics.

 

The asynchronous algorithm is implemented in a high performance computing cluster and we conduct numerical experiments for two-stage SUC instances of the Western Electricity Coordinating Council (WECC) system and of the Central Western European (CWE) system. The WECC system that we study consist of 130 thermal generators, 182 nodes and 319 lines with hourly resolution and up to 1000 scenarios, while the CWE system consist of 656 thermal generators, 679 nodes and 1073 lines, with quarterly resolution and up to 120 scenarios. When using 10 nodes of the cluster per instance, the algorithm provides solutions that are within 2% of optimality to all problems within 47 minutes for WECC and 3 hours, 54 minutes for CWE. Moreover, we find that an equivalent synchronous parallel subgradient algorithm would leave processors idle up to 84% of the time, an observation which underscores the need for designing asynchronous optimization schemes in order to fully exploit distributed computing on real world applications.

 

Bio

Ignacio Aravena obtained his B.Sc. and M.Sc. degrees in Electrical Engineering from Universidad Tecnica Federico Santa Maria (UTFSM), Chile, where he also served as lecturer and as industrial consultant. He is currently a Ph.D. student on Applied Mathematics at Universite Catholique de Louvain (UCL), Belgium. His research focuses on evaluating the impact of renewable energy integration on the European electricity markets, by using detailed models and high performance computing.

]]> Anita Race 1 1478546973 2016-11-07 19:29:33 1492118042 2017-04-13 21:14:02 0 0 event 2016-11-18T12:00:00-05:00 2016-11-18T13:00:00-05:00 2016-11-18T13:00:00-05:00 2016-11-18 17:00:00 2016-11-18 18:00:00 2016-11-18 18:00:00 2016-11-18T12:00:00-05:00 2016-11-18T13:00:00-05:00 America/New_York America/New_York datetime 2016-11-18 12:00:00 2016-11-18 01:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[SIAC Seminar - Bianca Colosimo ]]> 27187 TITLE: Zero-defect advanced manufacturing via statistical data modeling and monitoring

ABSTRACT:

Advanced Manufacturing is facing a new renaissance, due to the widespread of emerging process technologies (e.g., additive manufacturing, micro and nano-manufacturing) combined to a paradigm shift in sensing and computing. In this scenario, traditional approaches for intelligent data analysis (i.e., statistical data modeling, monitoring and control) need to be revised in order to deal with 3D quality features, multi-stream signal data, noncontact image point clouds. Starting from real industrial problems, some of the main challenges to be faced in these research fields are discussed. Viable solutions to enhance zero-defect manufacturing via in-line, in-situ statistical process monitoring are presented. Special attention is devoted to opportunities arising in metal Additve Manufacturing.

Bio:

Bianca Maria Colosimo is Professor in the Department of Mechanical Engineering of Politecnico di Milano, where she received her MSc and PhD in Industrial Engineering. She spent almost one year at the Pennsylvania State University (PSU) as a post-doc in 2001. Since then, she is cooperating with the Engineering Statistics Laboratory, directed by E. del Castillo (PSU).


Her research interest is mainly in the area of quality engineering (i.e. statistical process monitoring, control and optimization), with special attention to advanced manufacturing processes. On these topics, she is author of 100+ contributions, half of which have been published in peer-reviewed international journals and books. She is member of the Editorial Board of Journal of Quality Technology (American Society for Quality).

 

]]> Anita Race 1 1479140800 2016-11-14 16:26:40 1492118039 2017-04-13 21:13:59 0 0 event 2016-11-17T13:00:00-05:00 2016-11-17T14:00:00-05:00 2016-11-17T14:00:00-05:00 2016-11-17 18:00:00 2016-11-17 19:00:00 2016-11-17 19:00:00 2016-11-17T13:00:00-05:00 2016-11-17T14:00:00-05:00 America/New_York America/New_York datetime 2016-11-17 01:00:00 2016-11-17 02:00:00 America/New_York America/New_York datetime <![CDATA[]]> Kamran Paynabar

]]>
<![CDATA[Georgia Tech Capstone Design Expo]]> 27187

The Capstone Design Expo is one of the largest student design expos in the U.S. It is a showcase of Georgia Tech’s graduating seniors as they present their innovative projects designed and built during the Capstone Design Course. Students work in teams to solve either an industry problem, develop innovative tools to assist researchers or work on their own entrepreneurial idea.


Past expos have witnessed projects which have yielded significant results for our industry sponsors, saving some of them upwards of millions of dollars in research and development costs. The networking experience for students gives them the opportunity to make a lasting first impression on potential employers, while others have even walked away with an invitation to come and visit a potential employment opportunity with some of our sponsors.

]]> Anita Race 1 1479409840 2016-11-17 19:10:40 1492118036 2017-04-13 21:13:56 0 0 event 2016-12-06T17:30:00-05:00 2016-12-06T21:00:00-05:00 2016-12-06T21:00:00-05:00 2016-12-06 22:30:00 2016-12-07 02:00:00 2016-12-07 02:00:00 2016-12-06T17:30:00-05:00 2016-12-06T21:00:00-05:00 America/New_York America/New_York datetime 2016-12-06 05:30:00 2016-12-06 09:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[Statistics Seminar - George V. Moustakides]]> 27187 TITLE: Metrics and optimum tests for sequential change-detection

ABSTRACT:

We consider the problem of sequential detection of a change in the statistical behavior of an observed process. After presenting a panorama of applications from diverse scientific fields that can be formulated as a sequential change detection problem, we introduce the various metrics adopted in the literature for the mathematical setup of the problem of interest. In each case we make a thorough overview of the existing optimum detection strategies, mention applications the formulation is suitable for, and pay particular attention to results that have been recently developed. Finally, we discuss versions of the problems that are still open and have been challenging researchers for many years. 

 

 

BIO: George V. Moustakides received the diploma in Electrical and Mechanical Engineering from the National Technical University of Athens, Greece, the MSE in Systems Engineering from the Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, USA and the MSc and PhD in Electrical Engineering and Computer Science from Princeton University, Princeton, USA. Since 2007 he is with the department of Electrical and Computer Engineering, University of Patras, Greece while prior to this position he held long-term appointments as junior and senior researcher (directeur de recherche) with INRIA, France and as professor with the University of Thessaly, Greece. During his career Prof. Moustakides also held visiting scholar and/or adjunct professor positions at numerous universities in USA as Princeton University, University of Pennsylvania, Columbia University, University of Maryland, University of Illinois at Urbana-Champaign and recently Rutgers University. He has served as associate editor for Detection and Estimation (2011-2014) and is currently serving as inaugural associate editor for Sequential Methods (2016-2019) for the IEEE Transactions on Information Theory. His research focuses on Sequential Analysis and Statistical Signal Processing.

 

]]> Anita Race 1 1480349515 2016-11-28 16:11:55 1492118030 2017-04-13 21:13:50 0 0 event 2016-12-01T12:00:00-05:00 2016-12-01T13:00:00-05:00 2016-12-01T13:00:00-05:00 2016-12-01 17:00:00 2016-12-01 18:00:00 2016-12-01 18:00:00 2016-12-01T12:00:00-05:00 2016-12-01T13:00:00-05:00 America/New_York America/New_York datetime 2016-12-01 12:00:00 2016-12-01 01:00:00 America/New_York America/New_York datetime <![CDATA[]]> Yao Xie  yao.xie@isye.gatech.edu

]]>
<![CDATA[DOS Seminar - Lewis Ntaimo]]> 27187 TITLE: Irreducible Infeasible Subsystem (IIS) Decomposition for Probabilistically Constrained Stochastic Programming

ABSTRACT:

Probabilistically constrained stochastic programs (PC-SPs) have many applications in science and engineering but are very challenging to solve. Furthermore, linear programming (LP) provides very weak bounds on the optimal value. In this talk, we introduce a new decomposition approach using irreducible infeasible subsystem (IIS) inequalities to strengthen the LP-relaxation of PC-SPs. We first establish the theoretical results for determining IIS inequalities for the continuous case, and then extend the results to the binary case and give example illustrations. Next, we present an IIS branch-and-cut algorithm for PC-SP and report on preliminary computational results. 

 

Bio

Lewis Ntaimo received his Ph.D. degree in systems and industrial engineering in 2004, his M.S. degree in mining and geological engineering in 2000, and B.S. degree in mining engineering, all from the University of Arizona. He has been with Texas A&M University since 2004. Dr. Ntaimo research interests are in algorithms for large-scale stochastic optimization, systems modeling, and discrete event simulation. Recent applications include wildfire response planning, energy reduction in data centers, wind farm operations and maintenance, and patient and resource management in healthcare. His research has been funded by the National Science Foundation, Department of Homeland Security, and industry. Dr. Ntaimo is a member of INFORMS and IISE. He served as Vice Chair for the INFORMS Optimization Society from 2008-2010 and is now Vice President for the INFORMS Minority Issues Forum. He is on the Editorial Board of the Journal of Global Optimization is a member of the technical committee for the Society of Computer Simulation DEVS symposium.

 

]]> Anita Race 1 1480434137 2016-11-29 15:42:17 1492118030 2017-04-13 21:13:50 0 0 event 2016-12-06T12:00:00-05:00 2016-12-06T13:00:00-05:00 2016-12-06T13:00:00-05:00 2016-12-06 17:00:00 2016-12-06 18:00:00 2016-12-06 18:00:00 2016-12-06T12:00:00-05:00 2016-12-06T13:00:00-05:00 America/New_York America/New_York datetime 2016-12-06 12:00:00 2016-12-06 01:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[Seminar - Javad Lavaei]]> 27187 TITLE:  “Graph-theoretic Convexification of Polynomial Optimization Problems: Theory, Numerical Algorithm, and Case Studies”

ABSTRACT:

The area of polynomial optimization has been actively studied for years, where the goal is to find a high-quality solution using an efficient computational method. Some of the important research problems in this area are: i) how does the underlying structure of an optimization problem affect its complexity? Ii) how does sparsity help? iii) how to find a near globally optimal solution whenever it is hard to find a global minimum? iv) how to design an efficient numerical algorithm for large-scale non-convex optimization problems? v) how to deal with problems with a mix of continuous and discrete variables? In this talk, we will develop a new mathematical framework to study the above problems. Our framework rests on recent advances in graph theory and optimization, including the notions of OS-vertex sequence and treewidth, matrix completion, semidefinite programming (SDP), and low-rank optimization.

 

As an application, we will study four fundamental mixed-integer power optimization problems, named power flow, security-constrained optimal power flow, state estimation and unit commitment. Power optimization problems are at the heart of the multi-billion electricity market and 1-5% improvements in their solutions lead to saving billions of dollars annually. The design of better optimization techniques for power systems has been an active area of research since 1962. In this talk, we will show that real-world power networks have low treewidth, and as a result their SDP relaxation always has a low-rank solution. By leveraging this property, we will design a penalized SDP relaxation to find a near-global solution. We will illustrate our results on real-world power grids with over 13,000 nodes described by nonlinear equations subject to noise and corrupted data.

 

Bio

Javad Lavaei is an Assistant Professor in the Department of Industrial Engineering and Operations Research at University of California, Berkeley. He was an Assistant Professor at Columbia University from 2012 to 2015. He received the Ph.D. degree in Control and Dynamical Systems from the California Institute of Technology in 2011, and was a postdoctoral scholar in Precourt Institute for Energy and Electrical Engineering at Stanford University in 2011-2012. He is the recipient of the Milton and Francis Clauser Doctoral Prize for the best university-wide Ph.D. thesis, entitled "Large-Scale Complex Systems: From Antenna Circuits to Power Grids".  He researches on optimization theory, control theory and power systems. He has won several awards, including DARPA Young Faculty Award, Office of Naval Research Young Investigator Award, Office of Naval Research's Director of Research Early Career Award, Air Force Office of Scientific Research Young Investigator Award, National Science Foundation CAREER Award, Resonate Award, Google Faculty Research Award, Governor General of Canada Academic Gold Medal, Northeastern Association of Graduate Schools Master's Thesis Award, and Silver Medal in the 1999 International Mathematical Olympiad. Javad Lavaei is an associate editor of the IEEE Transactions on Smart Grid as well as the guest editor-in-chief of the IEEE Transactions on Smart Grid for a special issue on distributed computation, and serves on the conference editorial board of both IEEE Control Systems Society and European Control Association. He was a finalist (as an advisor) for the Best Student Paper Award at the 53rd IEEE Conference on Decision and Control 2014. His journal paper entitled "Zero Duality Gap in Optimal Power Flow Problem" has received a prize paper award given by the IEEE PES Power System Analysis Computing and Economics Committee in 2015. Javad Lavaei is a recipient of the 2015 INFORMS Optimization Society Prize for Young Researchers, the 2016 Donald P. Eckman Award given by the American Automatic Control Council, and the 2016 INFORMS ENRE Energy Best Publication Award.

]]> Anita Race 1 1480515272 2016-11-30 14:14:32 1480515272 2016-11-30 14:14:32 0 0 event 2016-12-12T12:00:00-05:00 2016-12-12T13:00:00-05:00 2016-12-12T13:00:00-05:00 2016-12-12 17:00:00 2016-12-12 18:00:00 2016-12-12 18:00:00 2016-12-12T12:00:00-05:00 2016-12-12T13:00:00-05:00 America/New_York America/New_York datetime 2016-12-12 12:00:00 2016-12-12 01:00:00 America/New_York America/New_York datetime <![CDATA[]]>
<![CDATA[SCL Course: Introduction to International Logistics and Compliance (Savannah, GA)]]> 27233 COURSE DESCRIPTION

This course is designed to provide students with an understanding of the complexities of global trade, its impact on logistics, and key areas of concern for international logistics managers. Key topics are investigated such as: Incoterms, global trade compliance, harmonized tariff schedules, US import and export regulations, US Free Trade Agreements, and supply chain security.

WHO SHOULD ATTEND

HOW YOU WILL BENEFIT

Upon completion of this course, you will be able to:

WHAT IS COVERED

COURSE MATERIALS

Participants receive a course notebook.

COURSE PREREQUISITES

None.

CERTIFICATE INFORMATION

This course is part of the Supply Chain Management (SCM) Certificate.

PROGRAM TIMES

On the first day, please check in at least 30 minutes before the class start time.

]]> Andy Haleblian 1 1456158378 2016-02-22 16:26:18 1476474279 2016-10-14 19:44:39 0 0 event This course is designed to provide students with an understanding of the complexities of global trade, its impact on logistics, and key areas of concern for international logistics managers. Key topics are investigated such as: Incoterms, global trade compliance, harmonized tariff schedules, US import and export regulations, US Free Trade Agreements, and supply chain security.

]]>
2016-10-19T09:00:00-04:00 2016-10-21T18:00:00-04:00 2016-10-21T18:00:00-04:00 2016-10-19 13:00:00 2016-10-21 22:00:00 2016-10-21 22:00:00 2016-10-19T09:00:00-04:00 2016-10-21T18:00:00-04:00 America/New_York America/New_York datetime 2016-10-19 09:00:00 2016-10-21 06:00:00 America/New_York America/New_York datetime <![CDATA[]]> info@scl.gatech.edu

]]>
<![CDATA[Course webpage within the SCL website]]> <![CDATA[Course registration page]]> <![CDATA[Link to Course Flyer]]>