A Neural Network Parallel Algorithm for Meeting Schedule Problems

Authors:
Kazuhiro Tsuchiya;Yoshiyasu Takefuji
Affiliations:
Fuji Electric Co. Research and Development, Ltd., 1, Fuji-machi, Hino, Tokyo 191, Japan/ and Faculty of Environmental Information, Keio University, 5322 Endoh, Fujisawa 252, Japan. E-mail: tsu ...;Faculty of Environmental Information, Keio University, 5322 Endoh, Fujisawa 252, Japan/ and Department of Electrical Engineering and Applied Physics, Case Western Reserve University, Cleveland, ...
Venue:
Applied Intelligence
Year:
1997

Citing 4
Cited 2

A formal study of distributed meeting scheduling: preliminary results

COCS '91 Proceedings of the conference on Organizational computing systems
Neural network parallel computing

Neural network parallel computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Meeting Scheduler for Office Automation

IEEE Transactions on Software Engineering

Hopfield neural networks for timetabling: formulations, methods, and comparative results

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A Potts neural network heuristic for the class/teacher timetabling problem

Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel algorithm for solving meeting schedule problems ispresented in this paper where the problem is NP-complete. Theproposed system is composed of two maximum neural networks whichinteract with each other. One is an M × S neural network to assign meetings to available time slots on a timetable where M andS are the number of meetings and the number of time slots,respectively. The other is an M × P neural network to assignpersons to the meetings where P is the number of persons. Thesimulation results show that the state of the system always convergesto one of the solutions. Our empirical study shows that the solutionquality of the proposed algorithm does not degrade with the problemsize.