In this paper, we develop the control rules for job shop scheduling based on the Flow Rate Control model. We derive optimal control results for job shops with work station in series (transfer line). We use these results to derive rules which are suboptimal, robust against random events, and easy to implement and expand.

This letter provides query-age-optimal joint sampling and transmission scheduling policies for a heterogeneous status update system, consisting of stochastic arrival generate-at-will source, with an unreliable channel. Our main goal is to minimize the average query age information (QAoI) subject sampling, transmission, per-slot constraints. To this end, optimization problem formulated solved by...

In this paper, we investigate the combination of synthesis, model-based learning, and online sampling techniques to obtain safe near-optimal schedulers for a preemptible task scheduling problem. Our algorithms can handle Markov decision processes (MDPs) that have $$10^{20}$$ states beyond which cannot be handled with state-of-the art probabilistic model-checkers. We provide probably approximate...

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...