# 2.CFP: IJAR-SI/Approximate Reasoning in Scheduling (Int. Journal of Approximate Reasoning)

Approximate Reasoning in Scheduling 97 (ars97@dbai.tuwien.ac.at)
Sun, 24 Nov 1996 16:46:36 +0100

Announcement and Call for Papers

Special Issue of the International Journal of Approximate Reasoning on
APPROXIMATE REASONING IN SCHEDULING
http://www.dbai.tuwien.ac.at/events/ars-si-ijar.html

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 special issue 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 the special issue is to collect a high-quality
selection of papers around this subject.

The special issue of the International Journal of Approximate
Reasoning on APPROXIMATE REASONING IN SCHEDULING will be preceded by a
workshop on the same subject (for details please see
http://www.dbai.tuwien.ac.at/events/ars97.html). 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. The intention is to have revised workshop
papers submitted for the special issue, together with papers that have
not been presented during the workshop. 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 by attending the workshop.

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

• approximation algorithms for combinatorial scheduling problems
• negative approximability results for combinatorial scheduling problems
• completeness results for approximation classes with relation to
combinatorial scheduling problems
• 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: modelling gradual
satisfaction, importance, and compromising
• probabilistic/Bayesian scheduling
• Dempster-Shafer based scheduling
• fuzzy scheduling and planning
• fuzzy/neuro/evolutionary/simulated-annealing/chaos and hybrid
scheduling
• possibilistic scheduling
• scheduling based on Rough Sets
• uncertainty, islands of certitude, imprecision, and vagueness in
scheduling
• knowledge base/parameter acquisition and elicitation for scheduling
• novel scheduling paradigms
• approximation in modelling and optimization of scheduling problems
• heuristic scheduling methods used in operations research/linear
programming
• approximability guarantees for scheduling problems based on the
primal-dual proof technique
• iterative improvement methods (min conflicts/tabu search/random
search)
• 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
studies
• related applications: planning, design, management, maintenance

Timetable for the special issue:

--- passed ---: Deadline for full manuscripts submitted to the
special issue of the International Journal of
Approximate Reasoning on APPROXIMATE REASONING IN
SCHEDULING.

Middle of July 1997: Reviews sent back to authors.

End of September 1997: Deadline for revised manuscripts.

Early 1998: Expected publication date.

Related event:

February 11, 1997: ARS'97 workshop. For details please see
http://www.dbai.tuwien.ac.at/events/ars97.html

SUBMISSION AND REVIEW OF PAPERS

Only original papers in English which have not been published and are
not under review by any other journal will be considered. All the
submitted papers will be peer-reviewed by experts in the field.

Please follow the style set by the instructions to authors of the
International Journal of Approximate Reasoning (an online copy is
available at http://www.dbai.tuwien.ac.at/events/ijar-ita.html), the
most important requirements being that papers should be double-spaced
and have large margins. There is no particular page limit.

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)

For the revised manuscript, a LaTeX style package is available (use
plain ftp command, not a WWW-browser in case you cannot connect) at
ftp://ftp.dbai.tuwien.ac.at/pub/ars/ija.sty

Electronic submission is strongly preferred. All submissions may be
sent either via ftp or by electronic mail (Postscript format,
compressed using "gzip" or "compress" under the file name
first-author.ps, then encoded using "uuencode"), or mail (in this case
send five hard-copies typed on one-side, plus one disc containing the
Postscript version or, if Postscript is not possible, some other
computer-format) to the following address:

Guest editor for the special issue:

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
mailto:ars97@dbai.tuwien.ac.at
http://www.dbai.tuwien.ac.at/events/ars-si-ijar.html

please also send a short mail indicating the name of your file and
(use plain ftp command, not a WWW-browser):

The organizers will acknowledge all successful prints.

INFORMATION

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

Additionally, a moderated electronic mailing list strictly limited to
the organization of the ARS events 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
listproc@dbai.tuwien.ac.at 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-related activities.

The homepage of the International Journal of Approximate Reasoning can
be found at http://www.elsevier.nl/locate/ijar