Skip to content
DraconiticResearch
Search Sources API
190,332 studies31 sourcesUpdated 56 min ago
PreprintarXiv licencearXiv

Efficient Detailed Scheduling of Multiproduct Pipelines using Action-Decoupled Deep Reinforcement Learning

Abstract

Multiproduct pipelines transport refined products to delivery stations in sequential batches, and their detailed scheduling must meet market demand while respecting nonlinear hydraulic constraints. Retaining the full hydraulic nonlinearity yields a mixed-integer nonlinear program that is computationally intractable, while the linearization commonly adopted for solver-based optimization degrades hydraulic accuracy without resolving the heavy computational burden. This paper develops an action-decoupled proximal policy optimization (PPO) framework that efficiently produces detailed schedules while preserving hydraulic fidelity. The scheduling process is cast as a semi-Markov decision process (SMDP) with flexible action durations. To handle the discrete-continuous hybrid action space, a cascaded dual-actor architecture decouples the discrete operating duration from the continuous flow decisions, eliminating the gradient interference that destabilizes conventional coupled-action policies and thereby yielding high-quality schedules far more efficiently. Validated on a real-world multiproduct pipeline in China and benchmarked against a single-actor baseline and a linearized MILP solved by Gurobi, the proposed framework achieves delivery accuracy close to the exact optimum while substantially improving flow rate stability and substantially reducing solution time.

Related

  1. Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders
    Mohsen Moradi, Vahid Nourozi, Wei Tang +1
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsQuantum physics & quantum informationarXiv
  2. A novel machine learning-based framework for integrating scheduling and control in continuous multiproduct chemical process operations
    Mehdi Abou El Qassime, Ahmed Shokry, Antonio Espuña +1
    Computers & Chemical EngineeringPeer-reviewedCC BYStatisticsHAL
  3. Low-Latency Belief-Propagation Decoding of Quantum LDPC Codes with Reinforcement-Learned Scheduling
    Mohsen Moradi, Ghilas Aissou, Taejoon Kim +2
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsarXiv
  4. SLAB: Time-Lag-Aware Deep Reinforcement Learning for Flexible Job-Shop Scheduling in PPVC Module Factories
    Ziheng Zhang, Dhivya Dharshini Kannan, Wei Zhang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Integrating YOLOv8-based disaster detection with deep reinforcement learning for closed-loop UAV emergency response scheduling: A simulation study
    Chunsheng Zhang, Ruichun He
    PLOS OnePeer-reviewedCC BYFull textNeuroscienceStatisticsPLOSEurope PMCPMC
BibTeX
@misc{shao2026efficient,
  title = {{Efficient Detailed Scheduling of Multiproduct Pipelines using Action-Decoupled Deep Reinforcement Learning}},
  author = {Kai Shao and Ling Jian and Liming Liu and Serguey V. Bogomolov and Xinmin Wang},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.02823},
  eprint = {2611.02823},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.02823},
}
RIS
TY  - UNPB
TI  - Efficient Detailed Scheduling of Multiproduct Pipelines using Action-Decoupled Deep Reinforcement Learning
AU  - Kai Shao
AU  - Ling Jian
AU  - Liming Liu
AU  - Serguey V. Bogomolov
AU  - Xinmin Wang
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.02823
UR  - https://arxiv.org/abs/2611.02823
AB  - Multiproduct pipelines transport refined products to delivery stations in sequential batches, and their detailed scheduling must meet market demand while respecting nonlinear hydraulic constraints. Retaining the full hydraulic nonlinearity yields a mixed-integer nonlinear program that is computationally intractable, while the linearization commonly adopted for solver-based optimization degrades hydraulic accuracy without resolving the heavy computational burden. This paper develops an action-decoupled proximal policy optimization (PPO) framework that efficiently produces detailed schedules while preserving hydraulic fidelity. The scheduling process is cast as a semi-Markov decision process (SMDP) with flexible action durations. To handle the discrete-continuous hybrid action space, a cascaded dual-actor architecture decouples the discrete operating duration from the continuous flow decisions, eliminating the gradient interference that destabilizes conventional coupled-action policies and thereby yielding high-quality schedules far more efficiently. Validated on a real-world multiproduct pipeline in China and benchmarked against a single-actor baseline and a linearized MILP solved by Gurobi, the proposed framework achieves delivery accuracy close to the exact optimum while substantially improving flow rate stability and substantially reducing solution time.
ER  -