IJAR SI on Approximate Reasoning in Scheduling is available online

Wolfgang Slany (wsi@dbai.tuwien.ac.at)
Wed, 5 Aug 1998 19:14:40 +0200 (MET DST)

I would like to announce the availability of a special issue on

Approximate Reasoning in Scheduling
in the
International Journal of Approximate Reasoning

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. On
the other hand, theoretical scheduling problems, that are concerned
with searching for optimal schedules subject to a limited number of
constraints, suffer from excessive combinatorial complexity. 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. The special issue reports
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 special issue appeared in Volume 19, Number 1-2 of IJAR, which
became available July 1998. In addition to the regular paper edition,
abstracts as well as full papers (pdf format) are available online at
the following address and mirror sites in the US and Japan:

http://www.elsevier.nl/cgi-bin/cas/tree/store/ija/cas_free/browse/browse.cgi?year=1998&volume=19&issue=1-2
http://www.elsevier.com/cgi-bin/cas/tree/store/ija/cas_free/browse/browse.cgi?year=1998&volume=19&issue=1-2
http://www.elsevier.co.jp/cgi-bin/cas/tree/store/ija/cas_free/browse/browse.cgi?year=1998&volume=19&issue=1-2

CONTENTS

Wolfgang Slany, Special issue on approximate reasoning in
scheduling -- Preface, pp. 1-3

M.P. Fanti, B. Maione, D. Naso, B. Turchiano, Genetic multi-criteria
approach to flexible line scheduling, pp. 5-21

Klaudia Dussa-Zieger, Markus Schwehm, Scheduling of parallel programs
on configurable multiprocessors by genetic algorithms, pp. 23-38

David Sinclair, The GST load balancing algorithm for parallel and
distributed systems, pp. 39-56

Teik Guan Tan, Wynne Hsu, Approximating scheduling for multimedia
applications under overload conditions, pp. 57-71

Claudia Leopold, Arranging program statements for locality on the
basis of neighbourhood preferences, pp. 73-90

Thomas Wagner, Alan Garvey, Victor Lesser, Criteria-directed task
scheduling, pp. 91-118

I.B. Turksen, M.H. Fazel Zarandi, Fuzzy system models for aggregate
scheduling analysis, pp. 119-143

Juergen Sauer, Gerd Suelmann, Hans-Juergen Appelrath, Multi-site
scheduling with fuzzy concepts, pp. 145-160

Andreas Raggl, Wolfgang Slany, A reusable iterative optimization
software library to solve combinatorial problems with approximate
reasoning, pp. 161-191

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

Best regards

--
Wolfgang SLANY                mailto:wsi@dbai.tuwien.ac.at
Technische Universitaet Wien E184-2  TEL: +43-1-58801-6123
Paniglgasse 16, A-1040 Wien, Austria    FAX: +43-1-5055304
WWW homepage:    http://www.dbai.tuwien.ac.at/staff/slany/

##################################################################### Information service for ARS'97, Approximate Reasoning in Scheduling. See also http://www.dbai.tuwien.ac.at/marchives/ars/index.html