On the public citation graph

Schedule Learning and Rule List Generation in Dynamic Shop Floor Conditions

0 signed · 20 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s10845-021-01847-3openalex-extracted
Reinforcement learning applications to machine scheduling problems: a comprehensive literature review
inferredcites →https://doi.org/10.1007/s10951-005-4781-0openalex-extracted
Discovering Dispatching Rules Using Data Mining
inferredcites →https://doi.org/10.1007/s10951-006-5591-8openalex-extracted
Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach
inferredcites →https://doi.org/10.1016/j.cie.2018.09.034openalex-extracted
Learning-based scheduling of flexible manufacturing systems using ensemble methods
inferredcites →https://doi.org/10.1016/j.compind.2020.103244openalex-extracted
Machine learning for predictive scheduling and resource allocation in large scale manufacturing systems
inferredcites →https://doi.org/10.1016/j.compind.2023.103933openalex-extracted
Towards live decision-making for service-based production: Integrated process planning and scheduling with Digital Twins and Deep-Q-Learning
inferredcites →https://doi.org/10.1016/j.eswa.2009.08.015openalex-extracted
An efficient job-shop scheduling algorithm based on particle swarm optimization☆
inferredcites →https://doi.org/10.1016/j.swevo.2019.100594openalex-extracted
An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals
inferredcites →https://doi.org/10.1038/s42256-019-0048-xopenalex-extracted
Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead
inferredcites →https://doi.org/10.1080/00207543.2019.1581954openalex-extracted
Learning dispatching rules using random forest in flexible job shop scheduling problems
inferredcites →https://doi.org/10.1080/00207543.2020.1741716openalex-extracted
Learning dispatching rules for single machine scheduling with dynamic arrivals based on decision trees and feature construction
inferredcites →https://doi.org/10.1080/0951192x.2020.1780318openalex-extracted
A hybrid algorithm combining genetic algorithm and variable neighborhood search for process sequencing optimization of large-size problem
inferredcites →https://doi.org/10.1080/0951192x.2021.1946849openalex-extracted
Development of dynamic scheduling in semiconductor manufacturing using a Q-learning approach
inferredcites →https://doi.org/10.1109/infocom.2018.8486422openalex-extracted
Online Job Scheduling in Distributed Machine Learning Clusters
inferredcites →https://doi.org/10.1126/scirobotics.aay7120openalex-extracted
XAI—Explainable artificial intelligence
inferredcites →https://doi.org/10.1145/3236009openalex-extracted
A Survey of Methods for Explaining Black Box Models
inferredcites →https://doi.org/10.1145/3292500.3332281openalex-extracted
Explainable AI in Industry
inferredcites →https://doi.org/10.1201/9781420044218openalex-extracted
Production Planning and Industrial Scheduling
inferredcites →https://doi.org/10.1504/ijmr.2018.092776openalex-extracted
Extraction of dispatching rules for single machine total weighted tardiness using a modified genetic algorithm and data mining
inferredcites →https://doi.org/10.3390/computers5010003openalex-extracted
Learning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees, Tabu Search and Simulation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.