[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

MISTA CALL FOR PARTICIPATION




--------------------- MISTA 2003: Call For Participation
------------------------------

     The 1st Multidisciplinary International Conference on Scheduling:
                        Theory and Applications (MISTA)

Wednesday 13th to Saturday 16th August 2003, hosted by The University of
Nottingham, UK.

This conference is the first in a series of conferences that serve as a
forum for an
international community of researchers, practitioners and vendors on all
aspects of
multi-disciplinary scheduling. The conference will cover, but not be
limited to, the
following disciplines: Artificial Intelligence, Computer Science,
Engineering,
Management, Manufacturing, Mathematics and Operational Research. The aim
is to bring
together scheduling researchers and practitioners from all the
disciplines that engage 
with scheduling research.

Conference Web Page
===================
For latest/more information see:

http://www.mistaconference.org

This page includes the registration details

Being held in conjunction with
==============================
INtroductory TutoRials in Optimization, Search and decision support
methodologies (INTROS'03)
Tuesday 12th August 2003, Nottingham, UK
See : http://www.mistaconference.org/intros03 for more details

Plenary Speakers
================
Michael Pinedo, Stern School of Business, New York University

Title : ORDER SCHEDULING MODELS WITH APPLICATIONS IN PRACTICE
Abstract : Order scheduling models can be described as follows. A
machine environment (e.g., a number of non-identical machines in
parallel) can produce a fixed variety of different products. Any one
machine can process a given set of different product types. If it can
process only one type of product it is referred to as a dedicated
machine, otherwise it is referred to as a flexible machine. A flexible
machine may be subject to a setup when it switches from one product type
to another product type. Each product type has certain specific
processing requirements on the various machines.
There are n customers, each one sending in one order. An order requests
specific quantities of the various different products; it has a release
date as well as a due date (committed shipping date). When the
processing of all the different products. for an order have been
completed, the order can be shipped.
We first introduce a notation for this class of models. We then focus on
various different machine environments and several objective functions,
including the total weighted completion time, the maximum lateness, the
number of orders shipped late, and so on. We present polynomial time
algorithms for some models, complexity proofs for problems that are
NP-Hard, as well as heuristics with their worst case performance and
empirical analyses.

We conclude with a number of practical applications of these models.

Stephen Smith
Title/Abstract : Not Yet Available


Gerhard Woeginger
Title/Abstract : Not Yet Available

Conference Scope (but not limited it)
=====================================
* Commercial Packages
* Automated Reasoning
* Timetabling
* Constraint Logic Programming
* Evolutionary Algorithms
* Rostering
* Knowledge-Based Systems
* Heuristic Search
* Real-Time Scheduling
* Local Search
* Shop-Floor Scheduling
* Multi-processor Scheduling
* Transport Scheduling
* Process Scheduling
* Complexity of Scheduling Problems
* Rule-Based Expert Systems
* Real World Scheduling
* Sports Scheduling
* Production Scheduling
* Vehicle Routing
* Machine Scheduling
* Meta-heuristic Search
* Batch Scheduling
* Theoretical Scheduling
* Applications
* Delivery Scheduling

International Advisory Committee
================================
* Graham Kendall (Chair), The University of Nottingham, UK
* Abdelhakim Artiba, Facultes Universitares Catholiques de Mons (CREGI -
FUCAM), Belguim
* Jacek Blazewicz, Institute of Computing Science, Poznan University of
Technology, Poland
* Peter Brucker, University of Osnabrueck, Germany
* Edmund Burke, The University of Nottingham, UK
* Xiaoqiang Cai, The Chinese University of Hong Kong, Hong Kong
* Ed Coffman, Columbia University, USA
* Moshe Dror, The University of Arizona, USA
* David Fogel, Natural Selection Inc., USA
* Fred Glover, Leeds School of Business, University of Colorado, USA
* Bernard Grabot, Laboratoire Gnie de Production - Equipe Production
Automatise, France
* Claude Le Pape, ILOG, France
* Toshihide Ibaraki, Kyoto University, Japan
* Mike Pinedo, New York University, USA
* Ibrahim Osman, American University of Beirut, Lebanon
* Jean-Yves Potvin, Universit de Montreal, Canada
* Michael Trick,Graduate School of Industrial Administration, Carnegie
Mellon University, USA
* Stephen Smith, Carnegie Mellon University, USA
* Steef van de Velde, Erasmus University, Netherlands
* George White, University of Ottawa, Canada

Program Committee
=================
* Graham Kendall (co-chair), The University of Nottingham, UK
* Edmund Burke (co-chair), The University of Nottingham, UK
* Sanja Petrovic (co-chair), The University of Nottingham, UK
* Uwe Aickelin, The University of Bradford, UK
* Hesham Alfares, King Fahd University of Petroleum & Minerals, Saudi
Arabia
* Abdelhakim Artiba, Facultes Universitares Catholiques de Mons (CREGI -
FUCAM), Belguim
* Belarmino Adenso-Diaz, University of Oviedo, Spain
* Philippe Baptise, IBM T. J. Watson Research Center, USA
* James Bean, Department of Industrial and Operations Engineering,
University of Michigan, USA
* Jacek Blazewicz, Institute of Computing Science, Poznan University of
Technology, Poland
* Joachim Breit, Saarland University, Germany
* Peter Brucker, University of Osnabrueck, Germany
* Xiaoqiang Cai, The Chinese University of Hong Kong, Hong Kong
* Jacques Carlier, Compigne cedex France
* Edwin Cheng, The Hong Kong Polytechnic University, Hong Kong
* Philippe Chretienne, Paris 6 University, France
* Ed Coffman, Columbia University, USA
* Peter Cowling, The University of Bradford, UK
* Patrick De Causmaecker, KaHo St.-Lieven, Ghent, Belgium
* Mauro Dell'Amico, University of Modena and Reggio Emilia, Italy
* Erik Demeulemeester, Katholieke Universiteit Leuven, Belgium
* Kath Dowsland, Gower Optimal Algorithms Ltd., UK
* Andreas Drexl, University of Kiel, Germany
* Moshe Dror, University of Arizona, USA
* Maciej Drozdowski, Poznan University of Technology, Poland
* Janet Efstathiou, University of Oxford, UK
* Wilhelm Erben, FH Konstanz - University of Applied Sciences, Germany
* Dror Feitelson, The Hebrew University, Israel
* Gerd Finke, Laboratory LEIBNIZ-IMAG, Grenoble, France
* Peter Fleming, University of Sheffield, UK
* David Fogel, Natural Selection, USA
* Dalibor Froncek, University of Minnesota, USA
* Michel Gendreau, Universit de Montral, Canada
* Celia A. Glass, Department of Actuarial Sciences and Statistics, City
University, UK
* Fred Glover, Leeds School of Business, University of Colorado, USA
* Bernard Grabot, Laboratoire Gnie de Production - Equipe Production
Automatise, France
* Alain Guinet, Industrial Engineering Department, INSA de Lyon, France
* Jin-Kao Hao, University of Angers, France
* Martin Henz, National University of Singapore, Singapore
* Jeffrey Herrmann, University of Maryland, USA
* Willy Herroelen, Department of Applied Economics, Katholieke
Universiteit Leuven, Belgium
* Han Hoogeveen, Utrecht University, The Netherlands
* Toshihide Ibaraki, Kyoto University, Japan
* Jeffrey Kingston, University of Sydney, Australia
* Hiroshi Kise, Kyoto Institute of Technology, Japan
* Wieslaw Kubiak, MUN, Canada
* Raymond Kwan, University of Leeds, UK
* Claude Le Pape, ILOG, France
* Chung-Yee Lee, The Hong Kong University of Science and Technology,
Hong Kong
* Arne Lkketangen, Dept. of Informatics, Molde College, Norway
* Dirk C. Mattfeld, University of Bremen, Germany
* David Montana, BBN Technologies, USA
* Martin Middendorf, University of Leipzig, Germany
* Alix Munier, LIP6, university Paris 12, France
* Alexander Nareyek, Carnegie Mellon University, USA
* Klaus Neumann, University of Karlsruhe, Germany
* Bryan A. Norman, University of Pittsburgh, USA
* Wim Nuijten, ILOG, France
* Ibrahim Osman, American University of Beirut, Lebanon
* Costas P.Pappis, University of Piraeus, Greece
* Erwin Pesch, University of Siegen, Germany
* Dobrila Petrovic, Coventry University, UK
* Michael Pinedo, New York University, USA
* Chris Potts, University of Southampton, UK
* Christian Prins, University of Technology, Troyes, France
* Jean-Yves Potvin, Universit de Montreal, Canada
* Kirk Pruhs, University of Pittsburgh, USA
* Vic J. Rayward-Smith, University of East Anglia, UK
* Colin Reeves, Coventry University, UK
* Celso C. Ribeiro, Catholic University of Rio de Janeiro, Brazil
* Andrea Schaerf, University of Udine, Italy
* Guenter Schmidt, Saarland University, Germany
* Roman Slowinski, Poznan University of Technology, Poland
* Stephen Smith, Carnegie Mellon University, USA
* Vincent T'Kindt, University of Tours, France
* Roberto Tadei, Politecnico di Torino, Italy
* Jonathan Thompson, Cardiff University, UK
* Michael Trick, Graduate School of Industrial Administration, Carnegie
Mellon University, USA
* Edward Tsang, University of Essex, UK
* Denis Trystram, ID - IMAG, France
* Steef van de Velde, Erasmus University, Netherlands
* Greet Vanden Berghe, KaHo St.-Lieven, Ghent, Belgium
* Stefan Voss, University of Hamburg, Germany
* Jan Weglarz, Poznan University of Technology, Poland
* Dominique de Werra, IMA, Facult des Sciences de Base, Lausanne,
Switzerland
* George White, University of Ottawa, Canada
* Darrell Whitley, Colorado State University, USA
* Gerhard J Woeginger, Faculty of Mathematical Sciences, University of
Twente, The Netherlands
* Yakov Zinder, University of Technology, Sydney, Australia
* Qingfu Zhang, University of Essex, UK