International Symposium on Scheduling 2006
July 18-20, 2006 in Arcadia Ichigaya, Tokyo, Japan
English / Japanese Call for Paper Notice
PDF version of the program is available here.
The deadline of registration is July 10, 2006.
* Registration form are avairable here.
The Japan Society of Mechanical Engineers. Manufacturing Systems Division
Scheduling Society of Japan
The Japan Society for Precision Engineering
The Institute of Systems, Control and Information Engineers
The Robotics Society of Japan
Japan Industrial Management Association
Japan Machine Tool Builders' Association
The Operations Research Society of Japan
Japan Society of Design Engineering
The Japan Society for Abrasive Technology
Manufacturing Science and Technology Center
The Society of Instrument and Control Engineers
The Japan Society for Quality Control
The Society of Automotive Engineers of Japan
The Japanese Society for Artificial Intelligence, etc.
Scheduling theory and practical technology in industry have made a remarkable progress in recent years. In particular, the importance of strategic scheduling increases as a key technology in the age of globalization and mega-competition. Furthermore, as the recent development of IT, the scheduling methodology and theory such as SCM, APS or TOC have been received great attention in industry.
Under the situation, this symposium is planned for both domestic and foreign researchers to get together and strengthen their relationships through active discussion. This time is the third one following the first held in Hamanako in 2002 and the second in Awajishima in 2004. We expect that new technologies and theories of strategic scheduling will be developed. We are looking forward to your participation in this symposium.
Chair of Organizing Committee: Hideo Fujimoto
Chair of Executive Committee: Kenji Yura
Chair of International Program Committee: Toshihide Ibaraki
Topics of Interest Fields:
Whole Themes related to Scheduling, for example, Scheduling Theory, Practical Scheduling Technology, Case Study of Scheduling Technology, Optimization Method, Evaluation Method, APS, SCM, CIM, JIT, TOC, Planning, Concurrent Engineering, etc.
* Keynote speeches and tutorials by prominent lecturers will be planned.
* The excellent papers presented in this symposium will be published in the special issue of International Journal by Japan Society of Mechanical Engineers.
* Best Paper Award will be arranged. This award will go to only one research in both scheduling theory and scheduling application, respectively.
PDF version is available here.
Tuesday, July 18, 13:30-14:30
Gate Scheduling at Airports
Institute of Information Systems, University of Siegen, Germany
Abstract: Flight-gate scheduling is concerned with finding an assignment of flights to terminal or ramp positions, called gates, and an assignment of the start and completion times of the processing of a flight at its position. A good assignment may reduce the number of aircraft tows required and may lead to reduced setup times for several ground service activities on the ramp as well as in the terminal.
The key idea behind the model presented here is to look at the problem as a modified multi-mode resource-constrained project scheduling problem with a multi-criteria objective function. The most important goals are the maximization of a total flight-gate preference value and the minimization of the number of tows. The basic optimization algorithm is a truncated branch-and-bound procedure that branches over gate assignments and the disjunctive constraints used to model the capacity restrictions of the disjunctive resources (gates). The algorithm uses constraint propagation techniques to reduce the search space. To cope with large practical problems within the order of magnitude of thousand flights per day, the problem is decomposed into loosely coupled subproblems using a new generic problem partitioning technique. The subproblems are used within a layered branch-and-bound approach: The search tree is conceptually split into layers that correspond to the subproblems. In each layer, only decision variables of the current subproblem are selected for branching; limited backtracking is performed within the current layer before proceeding to the next layer. Initial solutions obtained in this way are iteratively improved using a Large Neighbourhood Search technique that relaxes some of the decisions and uses the branch-and-bound algorithm to reform the relaxed part of the solution at a lower cost. The model and algorithm have been evaluated using small manually designed test cases as well as two weeks of a real-life flight schedule from a large international airport. A comparison of the computational results with a rule based approach, as often used in commercial systems, shows that the algorithm greatly improves the solution quality.
Wednesday, July 19, 11:40-12:40
Production Scheduling to Decrease Transportation Costs
Kathryn E. Stecke
School of Management, University of Texas at Dallas, USA.
Abstract: When make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the shipping cost. Without loss of generality, we consider that transportation is done by a third party logistics company such as FedEx or UPS, which provides multiple shipping modes such as overnight, one-day, two-day delivery, and more. When the transportation time has to be short, clearly shipping cost is more expensive than it could have been. How should a company schedule production for all accepted orders so that the company can leave enough transportation time for orders to take slow shipping modes to reduce the shipping cost? We study this problem of integrating the production and transportation functions for a manufacuturing company producing a variety of customized products in a make-to-order environment with a commit-to-delivery mode of business.
Various realistic scenarios are investigated, in increasing order of complexity. When partial delivery is allowed by customers, we provide both an MIP model and a minimum cost flow model. We show that nonpreemptive EDD production schedules are optimal when partial delivery is allowed and shipping cost is a decreasing convex function with transportation time. When partial delivery is not allowed, we develop an MIP model and prove that the problem is NP-hard. An efficient heuristic algorithm with polynomial computation time is provided for the NP-hard problem. It gives near-optimal production schedules, as shown via many numerical experiments. We also provide models and analysis for order scenarios where shipping cost accounts for cunstomer locations and quantity discounts.
Thursday, July 20, 11:20-12:20
Cyclic Machine Scheduling: A General Framework
Peter Brucker and Thomas Kampmeyer
University of Osnabrueck, Germany
Abstract: Cyclic versions of job-shop (or flow-shop) scheduling problems with special features like positive and negative time-lags or blocking and non-blocking situations are considered. Furthermore, transportation may be taken into account. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, and the single hoist scheduling problem. It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The same concepts can be used to solve cyclic scheduling problems with identical parallel machines and tool transportation between the machines, and computer pipelining problems.
Information Relevant to Paper Contribution:
Deadline of Paper Submission (full papers): March 24, 2006 (extended!) Notification of Review Results: April 30, 2006 (extended!) Deadline of Early Registration for Participation (requisite for presenters): May 31, 2006 Deadline of Camera-ready Manuscripts: May 31, 2006 Deadline of Registration for Participation: July 10, 2006
Members of the supporting societies: JPY 40,000 Non-members: JPY 50,000 Students: JPY 20,000 * Charge for one copy of proceedings, banquet and coffee breaks for a person are included.
* Registration form are avairable here.
2, 4 or 6 pages of paper (1000-1200 words per page)
Submission for Presentation:
(1)Presentation form (Research Presentation or Case-study presentation)
(3)Names and affiliations of authors
(4)Summary (within 200 words)
(5)Keywords (about 5)
(6)Name, affiliation, address, telephone and fax numbers, and e-mail address of the corresponding author
(8)The number of sheets of the paper (2, 4 or 6 pages)
* These above information and full papers should be submitted to: iss06-pa (at) vier.mech.nitech.ac.jp(*)
* Author's instruction and style files for LaTeX and Microsoft Word are available from here.
A camera-ready manuscript must be submitted by e-mail to
iss-06-pa (at) vier.mech.nitech.ac.jp(*)
by May 31, 2006.
* The manuscript MUST strictly follow our format.
* Author's instruction and style files for LaTeX and Microsoft Word are avairable at here.
The deadline of registration is July 10, 2006.
The deadline of early registration is May 31, 2006.
Please remember that your paper will be published in the symposium proceedings only if you
(or at least one of your co-authors) is officially registered by May 31 and "Copyright form"
has been signed and returned to the ISS2006 secretarist.
* Registration and Copyright transfer form are avairable at here.
iss06-pa (at) vier.mech.nitech.ac.jp(*)
Information (to the office of Organizing Committee):
Hideo Fujimoto, Chair of Organizing Committee
Department of Computer Science and Engineering
Graduate School of Engineering, Nagoya Institute of Technology
Gokiso-cho, Showa-ku, Nagoya 466-8555 Japan
E-mail: fujimoto.hideo (at) nitech.ac.jp(*)
Information (to the office of Executive Committee):
Kenji Yura, Chair of Executive Committee
Department of Systems Engineering, The University of Electro-Communications
1-5-1 Chofugaoka, Chofu-city, Tokyo 182-8585 Japan
E-mail: yura (at) se.uec.ac.jp(*)
* Please replace "(at)" with "@".
H. Fujimoto, Nagoya Inst. of Tech., Japan, Chair
E. Arai, Osaka Univ., Japan
H. Kise, Kyoto Inst. of Tech., Japan
H. Tokuyama, Shizuoka Univ., Japan
S. Fujii, Kobe Univ., Japan
K. Yura, Univ. of Electro-Communications, Japan
T. Ibaraki, Kwansei Gakuin Univ., Japan
M. Kuroda, Aoyama Gakuin Univ., Emeritus prof., Japan, Honorary Organizing Committee
K. Yura, Univ. of Electro-Communications, Japan, Chair
T. Kaihara, Kobe Univ. , Japan
N. Sugimura, Osaka Prefecture Univ. , Japan
H. Suwa, Setsunan Univ. , Japan
Y. Fukuda, Hosei Univ. , Japan
H. Hibino, JSPMI, Japan
S. Umeda, Musashi Univ. , Japan
M. Koike, College of Industrial Tech. , Japan
S. Takata, Waseda Univ. , Japan
M. Matsuda, Kanagawa Inst. of Tech. , Japan
M. Yokoyama, Fukushima Univ. , Japan
T. Tateno, Tokyo Metropolitan Univ. , Japan
M. Matsui, Univ. of Electro-Communications, Japan
Y. Nishioka, Hosei Univ. , Japan
M. Takata, Univ. of Electro-Communications, Japan
T. Yamada, Univ. of Electro-Communications, Japan
S. Umetani, Univ. of Electro-Communications, Japan
H. Narita, Nagoya Inst. of Tech. , Japan
International Program Committee:
T. Ibaraki, Kwansei Gakuin Univ. , Japan, Chair
K. Nonobe, Hosei Univ. , Japan
H. Tamaki, Kobe Univ. , Japan
H. Morita, Osaka Univ. , Japan
M. Yagiura, Nagoya Univ. , Japan
T. Tamura, Nagoya Inst. of Tech. , Japan
K. Ishii, Kanazawa Inst. of Tech. , Japan
Y. Karuno, Kyoto Inst. of Tech. , Japan
S. Miyazaki, Okayama Univ. , Japan
K. Miyashita, AIST, Japan
N. Yamaki, Shizuoka Univ. , Japan
K. Takeda, Aoyama Gakuin Univ. , Japan
N. Kato, Kyoto Univ. , Japan
N. Ueno, Prefectural Univ. of Hiroshima, Japan
K. Nakade, Nagoya Inst. of Tech. , Japan
H. Ishii, Osaka Univ. , Japan
K. Ohno, Aichi Inst. of Tech. , Japan
M. Konishi, Okayama Univ. , Japan
T. Nishi, Okayama Univ. , Japan
T. Terano, Tokyo Inst. of Tech. , Japan
S. Hasebe, Kyoto Univ. , Japan
M. Fuyuki, Kansai Univ. , Japan
S. Masuyama, Toyohashi Univ. of Tech. , Japan
S. Morito, Waseda Univ. , Japan
K. Yoneda, Fukuoka Univ. , Japan
M. Arakawa, Kansai Univ. , Japan
I. Inoue, Kyoto Sangyo University, Japan
Y. Sekiguchi, Hokkaido Univ. , Japan
I. Hatono, Kobe Univ. , Japan
K. Muramatsu, Tokai Univ. , Japan
K. Yasuda, Tohoku Univ. , Japan
Y. Yoshitomi, Kyoto Prefectural Univ. , Japan
K. Nakano, Kozo Keikaku Engineering Inc. , Japan
M. Nakano, Toyota Central R&D Labs. Inc. , Japan
S. Tomiyama, JFE R&D Corp. , Japan
K. Narimatsu, Toshiba Semiconductor Company, Japan
H. Narita, Nagoya Inst. of Tech., Japan
M. Siota, Nippon Steel Transportation Co., Ltd., Japan
Y. Nakao, Canon System Solutions Inc., Japan
T. Nishimura, Sumitomo Heavy Industries, Ltd., Japan
P. Brucker, Univ. of Osnabrueck, Germany
E. Pesch, Univ. of Siegen, Germany
A. Agentis, Univ. of Siena, Italy
Y. Crama, Univ. of Liege, Belgium
S. Elmaghraby, North Carolina State Univ., USA
K. E. Stecke, Univ. of Texas at Dallas - School of Management, USA
J. Efstathiou, Univ. of Oxford, UK
H. Hwang, KAIST, Korea
G. Kendall, Univ. of Nottingham, UK
K. Metaxiotis, National Technical Univ. of Athens, Greece
B. Mohd Omar, Univ. of Malaya, Malaysia
M. Sevaux, Univ. of South-Brittany, France
H. Shin, SAP Japan Co. Ltd., Japan
G. Steiner, McMaster Univ., Canada
L. Sun, Xi'an Jiaotong Univ., China
Z. Xiaobo, Tsinghua Univ., China
D. Zhu, Fudan Univ., China
June 16, 2006 last modified.