BulDML at Institute of Mathematics and Informatics >
International Journal ITA >
2005 >
Volume 12 Number 4 >

Please use this identifier to cite or link to this item:

Title: Learning Technology in Scheduling Based on the Mixed Graphs
Authors: Sotskov, Yuri
Sotskova, Nadezhda
Rudoi, Leonid
Keywords: Scheduling
Mixed Graph
Pattern Recognition
Issue Date: 2005
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: We propose the adaptive algorithm for solving a set of similar scheduling problems using learning technology. It is devised to combine the merits of an exact algorithm based on the mixed graph model and heuristics oriented on the real-world scheduling problems. The former may ensure high quality of the solution by means of an implicit exhausting enumeration of the feasible schedules. The latter may be developed for certain type of problems using their peculiarities. The main idea of the learning technology is to produce effective (in performance measure) and efficient (in computational time) heuristics by adapting local decisions for the scheduling problems under consideration. Adaptation is realized at the stage of learning while solving a set of sample scheduling problems using a branch-and-bound algorithm and structuring knowledge using pattern recognition apparatus.
ISSN: 1313-0463
Appears in Collections:Volume 12 Number 4

Files in This Item:

File Description SizeFormat
ijita12-4-p12.pdf123.58 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License