ALADDIN
CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Workshops
Carnegie Mellon / Technische Universiteit Eindhoven Collaborative Workshop
Aladdin
About
Calendar
People
PROBEs
Workshops
Papers
Education
Related Activities
Corporate
Contact
 
Captcha
Outreach Roadshow

2-3 July 2005
Carnegie Mellon University, Pittsburgh, PA
Newell Simon Hall 3305

The Carnegie Mellon/Technische Universiteit Eindhoven Collaborative Workshop will include researchers from different departments of the two universities with common interest in stochastic processes, inventory and supply chain management, task assignment, scheduling, and queueing theory, particularly as these are applied in computer science.

The purpose of the workshop is twofold:
(i) To establish a forum in which the participants can exchange ideas, develop common interests, and form research collaborations.
(ii) To discuss creation of a Center to support such collaborations in the future -- through future workshops, doctoral student exchanges, faculty visits, and the like. Such a discussion will focus on the aims and goals of the Center, as well as potential funding opportunities.

The workshop will consist of a dozen research-based presentations from participants, as well as a central discussion of the proposed Center.

Organizers    Speakers    Attendees
Mor Harchol-Balter, Carnegie Mellon University, contact Mor Harchol-Balter harchol@cs.cmu.edu, Tel (412) 268-7893
Alan Scheller-Wolf, Carnegie Mellon University, contact Alan Scheller-Wolf awolf@andrew.cmu.edu, Tel (412) 268-5066

Transportation and Accommodations
We have reserved hotel rooms for our out-of-town visitors at the Holiday Inn Select University Center, 100 Lytton Avenue, Pittsburgh, PA 15213, Tel (412) 682-6200.
Ground transportation between the airport and the Holiday Inn or Carnegie Mellon
Walking directions from the Holiday Inn to Newell Simon Hall 3305

Expense Reimbursement
Please submit completed form with original receipts by July 15, 2005 to Susan Hrishenko, susan027@cs.cmu.edu, Tel (412) 268-7317.
Expense reimbursement form

Agenda    Read the Abstracts    See the Poster
Saturday, 2 July 2005    Sunday, 3 July 2005
8:30 am Continental Breakfast / Discussion
9:30 am

Erik Winands, Technische Universiteit Eindhoven
A Two-Queue Model with Alternating Limited Service and State-Dependent Setups (abstract)

10:00 am

Maria Vlasiou, Technische Universiteit Eindhoven
On a non-increasing Lindley-type equation (abstract)

10:30 am Break / Discussion
11:30 am Bram Kranenburg, Technische Universiteit Eindhoven
Cost optimization in the (S-1,S) lost sales inventory model with priority demand classes (abstract)
12:00 pm Paul Enders, Technische Universiteit Eindhoven
A Mixed Lost-Sales Backordering Inventory Problem with Two Customer Classes (abstract)
12:30 pm Lunch
2:00 pm

Laurens Debo, Carnegie Mellon University
Herding and Congestion (abstract)

2:30 pm Geert-Jan van Houtum, Technische Universiteit Eindhoven
The Use of Queueing Theory in Inventory Problems (abstract)
3:00 pm Carnegie Mellon / Eindhoven Collaborative Center Discussion
5:00 pm Free time / Travel to Mor's House
6:00 pm Dinner Party at Mor's House
9:00 pm,
10:00 pm
Shuttle back to hotel
Sunday, 3 July 2005   Saturday, 2 July 2005
8:30 am Continental Breakfast / Discussion
9:30 am Bert Zwart, Technische Universiteit Eindhoven
Fluid approximation of a processor sharing queue with impatient customers (abstract)
10:00 am

Urtzi Ayesta, Centrum voor Wiskunde en Informatica
Mean Delay Analysis of Multilevel Processor Sharing (abstract)

10:30 am Break / Discussion
11:30 am Adam Wierman, Carnegie Mellon University
Classifying Scheduling Policies with Respect to Higher Moments of Conditional Response Time (abstract)
12:00 pm Alan Scheller-Wolf, Carnegie Mellon University
Simple Formula for Analysis of Alternating Load Queues (abstract)
12:30 pm Lunch
3:00 pm Tom van Woensel, Technische Universiteit Eindhoven
Variability in Dynamic Routing Problems (abstract)
3:30 pm Nicola Secomandi, Carnegie Mellon University
An Analysis of the Control Algorithm Re-solving Issue in Dynamic Resource Allocation Problems (abstract)
4:00 pm Continuation of Center Discussion and Wrap-Up
5:00 pm Free time
5:40 pm Shuttle departs NSH 3rd Floor entrance to restaurant
6:00 pm Dinner Party at Casbah
9:00 pm Shuttle back to hotel

 

This material is based upon work supported by National Science Foundation under Grant No. 0122581.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
National Science Foundation