CFP: Approximate Reasoning in Scheduling (ARS'97, Feb 11, 1997, Zurich)

Subject: CFP: Approximate Reasoning in Scheduling (ARS'97, Feb 11, 1997, Zurich)
From: wsi (
Date: Tue Jun 25 1996 - 23:41:19 MET DST

Announcement and Call for Papers

ARS'97 (

To be held at the Swiss Federal Institute of Technology (ETH),
Zurich, Switzerland
February 11, 1997

in conjunction with ISFL'97 (February 12 - 14, 1997), the
Second International ICSC Symposium on FUZZY LOGIC AND APPLICATIONS


                           CALL FOR PAPERS

Scheduling is a hard problem both in theory and in practice: On the
one hand, practical scheduling problems, although highly constrained,
are complex due to the number and variety of constraints
involved. Many of these constraints will be `soft', e.g., potentially
relaxable human preference constraints, rather than `hard' physical
constraints. In addition, a `good' schedule often needs to be
evaluated against a number of potentially conflicting goals which
themselves may not be precisely defined. Use of analytic techniques
to solve practical scheduling problems has in the past been limited
due to the lack of suitably expressive languages for knowledge
representation. On the other hand, theoretical scheduling problems,
which are concerned with searching for optimal schedules subject to a
limited number of constraints, suffer from excessive combinatorial
complexity. Simply put, the number of feasible schedules grows
exponentially along each dimension (machines, tools, orders,
etc.). Therefore, evaluating every solution and then choosing the best
one is normally intractable. Indeed, many of the most commonly
encountered scheduling problems have been shown to be
NP-hard. Therefore, algorithms finding exact solutions are in general
useless since they will not normally scale up to solving real world
problems. One solution that has recently drawn increased interest is
the use of approximate reasoning techniques both for optimization
algorithms as well as to model the problem and its components in order
to solve scheduling problems in a satisfactory way.

We encourage submissions of papers for the ARS'97 workshop that report
on advances in the core areas of approximate reasoning in the context
of scheduling, and on insights derived from building or using
applications that combine approximate reasoning and scheduling.

The idea behind ARS'97 is to bring together researchers from
different backgrounds to discuss issues related to the field of
approximate reasoning in scheduling, and to collect a high-quality
selection of papers around this subject.

ARS'97 will be followed by a special issue of the International
Journal of Approximate Reasoning on APPROXIMATE REASONING IN
for details). While these two events are related, it is possible to
submit a paper to only one of them. However, the linkage between the
workshop topic and the special issue topic is deliberate. Therefore,
the recommended way of participation is to submit a short paper to the
workshop and an extended version for the special issue. The workshop
will provide a great opportunity to meet and interact. Papers
submitted to the special issue of the journal will be thoroughly
peer-reviewed by an international program committee and revised by the
authors in order to guarantee a high standard. Papers submitted to the
workshop will be only informally reviewed, so acceptance to the
workshop is no guarantee that the extended version of a workshop paper
will be accepted for the special issue. However, the workshop will
allow cross-fertilization in the form of panel discussions and
presentations of different approaches followed by discussions so as to
make the workshop by itself a fascinating opportunity to meet and to
interact with colleagues from different fields doing research related
to approximate reasoning in scheduling. We anticipate that this
exchange of ideas will stimulate richer, more interesting papers for
the special issue. We encourage scholars who are interested in the
topic but who do not wish to present a paper to join the community we
will construct in Zurich.

Topics of interest include (but are not restricted to):

* partial constraint techniques in scheduling/constraint relaxation
* plausible/defeasible/evidential reasoning methods for scheduling
  (nonmonotonic, default, autoepistemic, temporal reasoning,
  circumscription, modal logic)
* multiple criteria decision making for scheduling: modeling gradual
  satisfaction, importance, and compromising
* probabilistic/Bayesian scheduling
* Dempster-Shafer based scheduling
* fuzzy scheduling and planning
* fuzzy/neuro/evolutionary/simulated-annealing/chaos and hybrid
* possibilistic scheduling
* scheduling based on Rough Sets
* uncertainty, islands of certitude, imprecision, and vagueness in
* knowledge base/parameter acquisition and elicitation for scheduling
* novel scheduling paradigms
* approximation in modeling and optimization of scheduling problems
* heuristic scheduling methods used in operations research/linear
* iterative improvement methods (min conflicts/tabu search/random
* benchmarking in approximate reasoning: comparative evaluation of
  crisp and soft schedules
* complexity analysis of approximation algorithms usable for
  scheduling, including consideration of average case complexity
* where are the really-hard scheduling problems, and can they be made
  tractable by approximate reasoning?
* robustness of schedules
* reactive scheduling
* cooperative scheduling
* distributed scheduling and multi-agent planning related to
  approximate reasoning
* man machine interfaces for scheduling tasks
* tools for approximate reasoning in scheduling
* solving real world scheduling problems using approximate reasoning:
  implementation aspects, success stories from such fields as flexible
  manufacturing (including tool management, vehicle routing, resource
  balancing), database transaction scheduling, CPU instruction
  scheduling, scheduling in administration, industry, finance and
  commerce (including shiftplan scheduling, work-force rota assignment,
  investment scheduling)
* soft scheduling applications in Japanese industry and research: case
* related applications: planning, design, management, maintenance


Timetable for the ARS'97 workshop:

August 19, 1996 (or earlier): Submission of abstract (500 words).
August 30, 1996 (or earlier): Notification of acceptance/rejection.
October 18, 1996: Submission deadline for revised full papers and late
                  original full papers that have not yet been announced
                  through an abstract (both max. 7 pages).

October 31, 1996: Notification of acceptance/rejection only for late
                  original full papers (that is, papers where no
                  abstract has been submitted).

February 11, 1997: ARS'97 workshop. In case we cannot make all
                   presentations and discussions fit into a single day,
                   there is the possibility of starting already on February
                   10, 1997 (Monday). This will be decided and
                   announced by October 31, 1996.



Those wishing to participate in the workshop should submit an abstract
of around 500 words, to reach the chairperson no later than August 19,
1996, at the address given below. Electronic submission of abstracts
as indicated below is strongly encouraged. All abstracts must be
written in English, starting with a succinct statement of the problem,
the results achieved, their significance, and a comparison with
related work.

If you missed the deadline for the abstract, you can still submit a
full paper until October 18, 1996. You will then be informed about
acceptance/rejection of your submission only by October 31, 1996.

All accepted papers will appear in the workshop proceedings published
by ICSC Academic Press. The proceedings will be available at the

Full Paper Format:

The full paper should be word processed for A4 or US Letter size
paper. The maximum length is seven pages including figures, tables,
and references. The manuscripts should be prepared in two column
format (figures and tables can be set across columns). Margins for A4
size: left and right: 20mm each; central (between columns): 10mm; top:
42mm; bottom: 25mm; Margins for Letter size: left and right: 0.75"
(20mm) each; central (between columns): 0.4" (10mm); top and bottom:
1" (25mm) each. Use proportional, serif typeface such as Times New
Roman. In general use type-size 10, respectively size 14 and 12 for
titles and subtitles. All text has to be single-spaced with
double-spacing between paragraphs. Do not use any automatic
page-numbering (in case you submit a printed version, please indicate
the page numbers as well as the name of the first author lightly at
the back in pencil). Manuscripts must include the main title (size
14), name and affiliations of the authors with a complete address for
correspondence, including email address if possible (size 12), and an
abstract of about 200 words, all centered across both columns.

For the special issue version of papers, a LaTeX style package is
available at

Each submission should also include:
- Title of proposed paper
- Authors names, affiliations, addresses
- Name of author to contact for correspondence
- E-mail address and fax number of contact author
- Topics which best describe the paper (max. 5 keywords)

The workshop language is English.

Electronic submission is strongly preferred. All submissions may be
sent either by electronic mail (ASCII text for abstracts, Postscript
format for final manuscripts, compressed using "gzip" or "compress"
under the file name, then encoded using "uuencode"),
or mail (in this case send two hard-copies) to the following address:


Wolfgang SLANY (ARS'97)
Institut fuer Informationssysteme (E 184-2)
Technische Universitaet Wien
Paniglg. 16, A-1040 Vienna, Austria, EUROPE

Tel: +43-1-58801-6123
Fax: +43-1-5055304

There is also the possibility of downloading your Postscript file to:

Downloading instructions are available at (use plain ftp command, not
a WWW-browser):

The organizers will acknowledge all successful prints.



Accepted papers should be presented at the workshop, in English, by
one of the authors.

Those wishing to attend the workshop without presenting a paper should
send a brief summary of their interest in the workshop to the
chairperson. Note that attendance will, of necessity, be limited.


Details on registration will be mailed as soon as decided by the
organizers of the ISFL'97 conference. They can be contacted at

International Computer Science Conventions
P.O. Box 279
Millet, Alberta T0C 1Z0 / Canada

Fax: +1-403-387-4329
Phone: +1-403-387-3546



Block reservations will be made at hotels close to the conference site
and accommodation at reasonable rates (not included in the
registration fee) will be available upon registration (full details
will follow with the letters of acceptance).


A social program, including a reception, sightseeing and a dinner will
be organized. This activity will also be available for accompanying

Winter is an attractive season in Switzerland and many famous
alpine resorts are in easy reach by rail, bus or car for a one
or two day excursion. The city of Zurich itself is the proud home
of many art galleries, museums and theaters. Furthermore, the world
famous shopping street 'Bahnhofstrasse' or the old part of the town
with its many bistros, bars and restaurants are always worth a


A world-wide-web page containing the latest information on the
workshop is available at

Additionally, a moderated electronic mailing list strictly limited to
the organization of ARS'97 has been set up. You are invited to join it
by sending the command

SUB ARS Firstname Lastname

where you replace "Firstname Lastname" by your real name, to in the body of an otherwise empty email
message. Your email-address will be automatically extracted from the
header of your mail. A confirmation of your subscription to the
mailing list plus further information will be sent to you. You will
then be kept up-to-date of all ARS'97-related activities.

For further information please contact the chairperson at the address
given above.


Swiss Federal Institute of Technology (ETH), Zurich, Switzerland
ICSC, International Computer Science Conventions, Canada/Switzerland
Christian Doppler Laboratory for Expert Systems, Vienna, Austria

This archive was generated by hypermail 2b25 : Fri Mar 03 2000 - 16:17:09 MET