Adaptive scheduling algorithm based on mixed graph model

DOI10.1049/IP-CTA:19960089MaRDI QIDQ4885771zbMATH OpenOpenAlexWikidataFDO

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

Publication date 25 November 1996

Published in IET Control Theory \& 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)

Recommendations

• A remark on adaptive scheduling of optimization algorithms
• An adaptive genetic algorithm for solving a class of combinatorial scheduling problems
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

Cited in

(6)

• A DRL based approach for adaptive scheduling of one-of-a-kind production
• A remark on adaptive scheduling of optimization algorithms
• 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
• Deterministic job-shop scheduling: Past, present and future
• Vyacheslav Tanaev: contributions to scheduling and related areas

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885771)