Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Adaptive scheduling algorithm based on mixed graph model

From MaRDI portal
Publication:4885771
Jump to:navigation, search

DOI10.1049/ip-cta:19960089zbMath0851.90068OpenAlexW2115710572WikidataQ57633997 ScholiaQ57633997MaRDI QIDQ4885771

Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner

Publication date: 25 November 1996

Published in: IEE Proceedings - Control Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1049/ip-cta:19960089


zbMATH Keywords

adaptive approachheuristic rule


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)


Related Items (4)

A neural network algorithm for servicing jobs with sequential and parallel machines ⋮ An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Deterministic job-shop scheduling: Past, present and future




This page was built for publication: Adaptive scheduling algorithm based on mixed graph model

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4885771&oldid=19263812"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 05:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki