Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > F. Theory of Computation  > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY  > F.2.2 Nonnumerical Algorithms and Problems 
LEARNING TECHNOLOGY IN SCHEDULING BASED ON THE MIXED GRAPHS
By: Sotskov et al. (3920 reads)
Rating: (1.00/10)

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.

Keywords: Scheduling, mixed graph, learning, pattern recognition.

ACM Classification Keywords: F.2.2 Nonnumerical algorithms and problems: sequencing and scheduling.

Link:

LEARNING TECHNOLOGY IN SCHEDULING BASED ON THE MIXED GRAPHS

Yuri Sotskov, Nadezhda Sotskova, Leonid Rudoi

http://www.foibg.com/ijita/vol12/ijita12-4-p12.pdf

Print
F.2.2 Nonnumerical Algorithms and Problems
article: CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES · LINEAR PROGRAM FORM FOR RAY DIFFERENT DISCRETE TOMOGRAPHY · CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS · IMPLEMENTATION OF DICTIONARY LOOKUP AUTOMATA FOR UNL ANALYSIS AND GENERATION · APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)-MATRICES WITH DIFFERE · SELF-MODIFICATED PREDICATE NETWORKS · THE INVERSE MASLOV METHOD AND ANT TACTICS FOR EXHAUSTIVE SEARCH DECREASING · CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1 · CONSTRUCTION OF CLASS LEVEL DESCRIPTION FOR EFFICIENT RECOGNITION OF ... · EFFICIENT SIMULATION FOR PROLOG IMPLEMENTATION OF IMAGE RECOGNITION PROBLEM · THE INVERSE METHOD FOR SOLVING ARTIFICIAL INTELLIGENCE PROBLEMS IN ... · EVALUATION OF GREEDY ALGORITHM OF CONSTRUCTING (0,1)-MATRICES WITH DIFFERENT ... · DISCRETE ARTIFICIAL INTELLIGENCE PROBLEMS AND NUMBER OF STEPS OF THEIR SOLUTION · ON STRUCTURAL RECOGNITION WITH LOGIC AND DISCRETE ANALYSIS · SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES ... · REALIZATION OF AN OPTIMAL SCHEDULE FOR THE TWO-MACHINE · RECENT RESULTS ON STABILITY ANALYSIS ... · LEARNING TECHNOLOGY IN SCHEDULING BASED ON THE MIXED GRAPHS ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.54MB ]   [ GZIP Disabled ]   [ Server load: 0.40 ]
Powered by Tikiwiki CMS/Groupware