From Tagung.PMS.2000@MATHEMATIK.UNI-OSNABRUECK.DE Tue Jul 27 02:13:57 1999 Date: Fri, 16 Jul 1999 10:59:07 +0200 (MET DST) From: Tagung PMS 2000 To: dmanet@zpr.uni-koeln.de, opt-net-adm@ZIB.DE Subject: [DMANET] PMS 2000 - call for paper ////////////////////////////////////////////////////////////////// // // // Call For Papers // // // // SEVENTH INTERNATIONAL WORKSHOP ON // // PROJECT MANAGEMENT AND SCHEDULING (PMS 2000) // // // // April, 17-19, 2000 // // // // Department of Mathematics/Computer Science // // University of Osnabrueck // // Germany // // // ////////////////////////////////////////////////////////////////// OBJECTIVES ================================================================= The main objectives of PMS 2000 are to bring together researchers in the area of project management and scheduling in order to provide a medium for discussions of research results and research ideas and to create an opportunity for researchers and practitioners to get involved in joint research. Special sessions on applications like railway scheduling, timetabling, batch scheduling in the chemical industry, robot scheduling, etc. are planned. To retain a ``workshop atmosphere'' as much as possible, sufficient time will be provided for presentations and discussions. SCOPE ================================================================= PMS 2000 will cover the following list of topics but is not limited to. Project Management - Network modeling - Single and multi-project scheduling - Resource management - Due-date management - Uncertainty issues in project management Machine Scheduling - Single machine scheduling - Parallel machine scheduling - Shop Scheduling (Flow Shop, Job Shop, Open Shop) - Scheduling of Transportation Robots - Machine assignment and scheduling Other Applications of Scheduling - Timetabling - Railway scheduling - Batch Scheduling in the Chemical Industry ABSTRACT SUBMISSION ================================================================= An extended abstract (2-3 pages, including a short abstract of maximal 130 words) should be submitted before SEPTEMBER 15, 1999. Electronic submissions via e-mail (in LaTex using the example on the conference website) are strongly encouraged. Please refer to the conference website http://www.mathematik.uni-osnabrueck.de/research/OR/pms2000/ for further submission instructions. PREREGISTRATION ================================================================= If you are interested in participating, please visit our website http://www.mathematik.uni-osnabrueck.de/research/OR/pms2000/ in order to complete the preregistration form, or send an e-mail to pms2000@mathematik.uni-osnabrueck.de. Preregistration does not involve any obligations, but helps us to plan the schedule and keep you informed. ORGANIZING COMMITTEE ================================================================= Peter BRUCKER (Chairman) Silvia HEITMANN Maria Anna GAUSMANN Johann HURINK Teresa GEHRS Sigrid KNUST IMPORTANT DATES =================================================================== Abstract deadline: SEPTEMBER 15, 1999 Notification of acceptance: DECEMBER 15, 1999 Revised Abstract deadline: JANUARY 21, 2000 Workshop registration deadline: JANUARY 31, 2000 =================================================================== INFORMATION SOURCES =================================================================== Up-to-date information, including information on hotels and the city of Osnabrueck, can be found at http://www.mathematik.uni-osnabrueck.de/research/OR/pms2000/ ------------------------------------------------------------------- ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * **********************************************************