专题1: Make Your Research in Scheduling Effective (3小时)
报告人：Chung-Yee
Lee教授，Department of
Industrial Engineering & Engineering Management
Logistics and Supply Chain Management Institute，The Hong Kong University of Science and Technology.
专题2: You and Your Research in
the Field of Scheduling(3小时)
报告人：Salah E. Elmaghraby教授，Dept. of Ind. Eng. and The Graduate Program in Oper. Res. North Carolina State
University, Raleigh, NC.
专题3: Make Your Schedule with Incomplete Information(3小时)
报告人：张国川教授，浙江大学数学系。
专题4：Real-case Problems and
Research in Scheduling(3小时)
报告人：韩继业教授，中国科学院应用数学研究所；邢文训教授，清华大学数学科学系。
报告地点：清华大学数学科学系理科楼1304
联系人：北京清华大学数学科学系（100084）王振波
Email:
wzb01@mails.tsinghua.edu.cn
学习班倡导和组织人员： 方述诚教授（北卡州立大学），李忠义教授（香港科技大学），Salah E. Elmaghraby教授（北卡州立大学），邢文训教授（清华大学）。
欢迎参加！
注意事项：本学习班得到清华大学基金会方述诚讲席教授组部分资金支持，将对参加学习班的北京地区以外的部分青年学者和研究生给以住宿和伙食补贴。请有意得到资助者于2005年5月31日前将申请表格发回，我们将于6月10日通知获得资助的信息。其他需要解决住宿的学习班成员请在回执中标明住宿的需求，于2005年6月10日前将回执发回。我们将于2005年6月24日9：00-18：00在清华大学数学科学系（理科楼大厅）接待预约安排住宿的学习班成员。请尽量采用电子邮件的方式同我们联系。
回执
|
姓名 |
|
性别 |
|
教师/博士生/博士后/硕士生 |
|
|||
|
所在学校 |
|
电子邮件地址 |
|
|||||
|
预定床位标准 |
|
A.50元左右，B.100元左右，C.150元以上，D.自己安排 |
||||||
|
如果申请住宿和伙食补贴，请填写下列内容 |
||||||||
|
导师姓名 |
|
导师联系电话 |
|
|||||
|
导师电子邮件 |
|
是否经导师同意参加学习班 |
|
|||||
学习班详细内容和时间安排请继续阅读以下部分！
Activitity of S-C Fang's Team of Chair Professors in Mathematitical Sciences
and Industrial Engineering of Tsinghua University
Tsinghua University, Beijing, PRC.
2005.6.25-6.26
Topic One
Make Your Research in
Scheduling Effective
(9:00-12:00, June 25, 2005.)
Chung-Yee Lee
Department of Industrial Engineering & Engineering Management
Logistics and Supply Chain Management Institute
The Hong Kong University of Science and Technology
(i) The current trend of
scheduling research (25 min)
Survey of experts’ opinions
Theory vs. Practice
Planning vs. Scheduling
How to find a good research topic?
(ii) Help your editor
accept your paper (25 min)
What is the editor looking for?
How to revise a paper?
How to respond to editor and referees’ comments?
(iii) Research
experiences (100 min)
Scheduling on batch processing
machine
Multiprocessor task scheduling
Machine scheduling with availability constraints
Machine scheduling with transportation consideration
Logistics scheduling under disruption
Supply chain scheduling and other contemporary topics
Topic
Two
You and Your Research
in the Field of Scheduling
(13:30-16:30,
June 25, 2005.)
Salah E. Elmaghraby
Dept. of Ind. Eng. and The Graduate Program in Oper. Res.
North Carolina State University, Raleigh, NC
This session shall explore three aspects of research activities in
the field of scheduling. (1) The relation between scheduling and some other
areas of production engineering such as routing, supply chain management, and
project planning and control. (2) The requisite background for the researcher
and the variety of tools needed for modeling and analysis. (3) The challenges
offered by new technologies such as e-commerce and RFID.
The participant in this workshop shall learn, through examples, of the threads of development in two areas: shop scheduling and activity scheduling in project work. S/he shall be made aware of the various areas in engineering, mathematics, and computer science that are relevant and would enhance the capability to do research in this field. And s/he shall gain insight into doing research in general that would sharpen her/his capabilities.
The 3 hours allowed shall be divided into three equal parts, each of approximately 50 minutes duration. Some time will be devoted in each part for questions and answers.
The progress from the TSP, to the
Multi-TSP, to some of their Variants as illustration
of the relation between shop scheduling and vehicle routing.
The history of CPM-PERT as demonstration of the shift from a general
planning focus to the RCPSP as demonstration of the relation between scheduling
and project planning and control.
The history of the single machine scheduling under deterministic conditions to multi-machine scheduling under uncertain conditions as example of the new emphasis on real time adaptive behavior.
This will bring into focus some of the requisite background for doing research in scheduling, and the approaches used to cope with increased complexity.
Topic Three
Make Your Schedule with Incomplete
Information
(9:00-12:00,
June 26, 2005.)
Guochuan
Zhang
Department of Mathematics
Zhejiang University
Scheduling algorithms are the basis of
efficient resource management. Making a schedule can be considered in two
different contexts: with full information and with incomplete information. In
the latter case, the decision at a time must be made based on past events
without secure information about the future. To do this we need online
algorithms. Any online algorithm may not produce an optimal schedule because of
the absence of information even if the problem is trivial in the case that
complete information is known beforehand. In some sense online scheduling
problems are beyond the class of hard problems.
The goal of this talk is to provide
sufficient breadth and depth so that a participant new to the area would be
able to begin research on online scheduling. In addition to presenting the more
essential ideas and well-known results, we will lead participants to the newest
improvements of this area and will provide a list of open problems of interest.
The 3 hours will be divided into two parts, each of approximately 75 minutes duration. The time in between will be devoted to questions and answers.
(i) What information is absent? - On-line scheduling models (15 min)
Jobs arrive over list
Jobs arrive over time
Jobs
arrive on dependencies
(ii) How to design and analyze an on-line
algorithm? (10min)
Preliminaries and basic ideas: lower bound, competitive analysis, greedy
approach, optimal on-line algorithms.
(iii) Classical on-line scheduling problems (50 min)
List
scheduling, improved on-line algorithms, current champion, generalized results
On-line
LPT, optimal algorithm for two machines
On-line
scheduling with precedence (optional)
(iv) On-line scheduling on networks (50 min)
Network
topology, relation to bin packing, on-line scheduling on PRAM, on-line
scheduling on meshes, etc.
(v) Beyond on-line scheduling (25min)
Discussion on relaxed on-line models and
potential research topics.
Topic Four
Real-case Problems and Research in Scheduling
(13:30-16:30,
June 26, 2005.)
Jiye Han
Institute of
Applied Mathematics
The Chinese
Academy of Sciences
Wenxun Xing
Department of Mathematical Sciences
Tsinghua University
This session shall present models, theoretically analytical results
and potential research topics based on three real-case scheduling problems in
China. The three problems are: (1)
airplane scheduling, (2) flexible flow-shop scheduling with no-wait jobs
and no-idle machines in a steel factory, and (3) analysis of policies in
service systems.
The goal of
this presentation is to share our experience with the audience on: how to find
and describe the problems in real life situations, how to analyze the problems
using analytical and computational methods of scheduling, and how to apply our
results to the real life problems. Some open problems derived from the real
problems will be given.
The 3 hours allowed shall be divided into three equal parts, each of
approximately 50 minutes duration. Some time will be devoted in each part for
questions and answers.
Part 1 Airplane scheduling (50 minutes) (Speaker
Prof. Jiye Han)
The airline business is quite unique. The “product”
offered by an airline is represented by flights that carry passengers or cargo
from various origins to various targeted destinations. The marketability of the
product, as perceived by air transportation customers, is judged by the flexibility
of schedules, on-time flights, safety, satisfactory in-flight services, proper
baggage handling, and convenient ticketing transactions. Safety is of primary importance.
The air transportation market is very competitive. In order to gain a
competitive advantage in the market, advanced optimization techniques have been
widely used in the management of today’s air transportation. This talk relates
two problems of an airline in China: the crew allocation problem and the scheduling
of ground service system at airports. Some scheduling models of parallel
machines and scheduling with release times and due dates and relevant
algorithms are used to solve these two problems. Other OR problems in the
airline industry will be also briefly discussed.
Part 2 Flexible flow-shop scheduling with
no-wait jobs and no-idle machines in a steel factory (50 minutes) (Speaker
Prof. Wenxun Xing)
Melting
and casting are two key operations in iron and steel manufacturing, which
correspond to the two stages of a flow-shop. Except for the transportation
time, no extra waiting time is allowed between the two stages to keep the
molten steel at a high temperature. Furthermore, no idle time is allowed
between any two consecutive processed jobs on each machine in the second stage
(casting) to keep the billets cast continuously.
The
problem is how to schedule the two-stage flexible flow-shop with 3 and 4
machines at each stage, respectively?
Part 3 Analysis of service policies in service
systems (50 minutes) (Speaker Prof. Wenxun Xing)
In
many service and manufacturing systems, like web service demands, ticket checking,
electronic equipment repair, vehicle repair, product processing; etc., there usually
are some special facilities that offer “special” services as well as “normal” services,
with some other facilities offering “normal” services only. Many policies could
be chosen by the managers of the systems such as: FCFS, Hi-Priority First; etc.
The issue here is: Which is the preferred policy?