arXiv Machine Learning By Taicheng Zheng, Dan Li, Jie Li

Bayesian dynamic scheduling of multipurpose batch processes under incomplete look-ahead information

Read the original on arXiv Machine Learning →

The paper introduces a Bayesian dynamic scheduling method for multipurpose batch processes that operates under incomplete look‑ahead information. By learning a Bayesian Network from the probability distribution of disturbances, the method updates posterior distributions online and guides rescheduling decisions. Compared with a periodic rescheduling strategy, the approach yields statistically better long‑term costs and reduced system nervousness on benchmark problems.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Aug 17

Reinforcement Learning-Based Production Scheduling in an Industry-Based Coating Scenario Using the Digital Model Playground

arXiv:2608. 14122v1 Announce Type: new Abstract: Production scheduling in complex manufacturing environments is challenging when sequence-dependent setup times, stochastic disturbances, and due-date constraints must be addressed simultaneously.

By Arne Kr\"oger, Ralf Buscherm\"ohle, Wilhelm Hasselbring, Henrik Wilbers
arXiv AI
Sep 12

Planning and Scheduling Business Processes under Control-Flow Uncertainty: Extended Version

The paper addresses the challenge of scheduling business process activities when the exact sequence of required tasks is uncertain due to data‑driven decisions made during execution. It proposes framing the problem as a chance‑constrained optimization and introduces two formulations: a decomposed two‑stage approach (planning to minimize superfluous activities under a feasibility constraint, followed by scheduling to minimize makespan) and an integrated single‑stage approach. Experiments on two real‑world and one synthetic dataset show that the integrated method achieves better makespans but struggles with scalability, whereas the decomposed method scales to larger settings.

By Michel Kunkler, Stefanie Rinderle-Ma
arXiv AI
Sep 10

Planning and Scheduling Business Processes under Control-Flow Uncertainty

The paper addresses the challenge of scheduling business process activities when the exact sequence of required tasks is uncertain due to data-driven decisions made during execution. It proposes framing the problem as a chance-constrained optimization and introduces two formulations: a decomposed two-stage approach that first minimizes expected superfluous activities under a feasibility constraint and then schedules to minimize makespan, and an integrated approach that combines planning and scheduling into a single model. Experiments on two real-world and one synthetic dataset show that the integrated approach achieves better makespans but struggles with scalability, whereas the decomposed approach scales to larger settings.

By Michel Kunkler, Stefanie Rinderle-Ma