Browse
Keywords
Records with Keyword: Scheduling
Showing records 1 to 25 of 70. [First] Page: 1 2 3 Last
Simulation-Optimization vs. MILP Approaches for Real-Time Scheduling of Multiproduct Batch Plants
Engelbert Pasieka, Sebastian Engell
June 12, 2026 (v1)
Production scheduling in the process industry is often treated as a static optimization problem, although real plants require frequent rescheduling due to disturbances such as rush orders, equipment breakdowns, and changes in processing times. This paper compares a simulation-optimization approach that couples a discrete-event simulator with an evolutionary algorithm (EA) with a sequence-based mixed-integer linear programming (MILP) formulation for real-time scheduling of multistage batch systems. Both methods are embedded in an event-driven rolling-horizon framework under strict computation time limits.In static experiments for a 3-stage, 2-machine flow-shop setting (10 products, 20 orders, random processing times), the EA achieved lower makespans across all tested time budgets, improving results by about 7-13% on average compared to the MILP approach. In real-time experiments (40 initial orders, maintenance, three rush orders, 10 s and 60 s periodic updates), the solution quality of... [more]
Research on Dynamic Scheduling of Multi-line Polyolefin Production Based on Deep Reinforcement Learning
Zhineng Tao, Tong Qiu, Zhenzhi Gong, Fenglian Dong, Zhiwei Wei, Yunlong Guan
June 12, 2026 (v1)
Keywords: Modelling and Simulations, Optimization, Polyolefin production, Reinforcement learning, Scheduling
The scheduling of multi-line polyolefin production is a complex decision-making process characterized by sequence-dependent changeovers, strict physicochemical constraints, and dynamic market environments. Traditional optimization methods often suffer from high computational costs and a lack of flexibility in online adjustments. To address these challenges, this paper proposes a Deep Reinforcement Learning (DRL) framework for dynamic scheduling tasks. We first construct a high-fidelity simulation environment that meticulously models realistic industrial constraints, including transition materials, shutdowns, and inventory limits. A Soft Actor-Critic (SAC) agent with a tuple-based action space is employed to mitigate the combinatorial explosion associated with multi-line decisions. Furthermore, a dynamic action masking mechanism embedded with domain knowledge is introduced to strictly enforce hard constraints and significantly improve sample efficiency. Case studies based on real-world... [more]
Set-based Formulations for the State Task Network Scheduling Problem
David A. Liñán, Georgia Stinchfield, Carl D. Laird, Jan Kronqvist
June 12, 2026 (v1)
Keywords: Batch Systems, Modelling, Optimization, Process Operations, Scheduling
The state task network (STN) representation is a widely used modeling approach for optimal multipurpose batch production scheduling. In practice, STNs have been traditionally formulated as mixed-integer programming (MIP) problems and solved using general-purpose MIP solvers relying on branch-and-bound and branch-and-cut. In the meantime, alternative modeling and solution paradigms for optimization have been developed, enabling the incorporation of alternative variable types and optimization algorithms. Specifically, this work relies on the Hexaly software, which introduced set-based models and their solution through general-purpose hybrid algorithms, i.e., methods that combine traditional MIP with constraint programming, local search, large neighborhood search, among other tools. So far, Hexaly has shown promising results when tackling optimal scheduling problems, however, set-based models and solution approaches for STN optimization have not been studied in the literature. Aiming to f... [more]
Optimizing Flexible Operation of Grid-Connected Electrolyzers: Storage Capacity as the Key to Economic Viability
Julian Pamperin, Hannes Lange, Michael Große, Leon Urbas
June 12, 2026 (v1)
Keywords: Hydrogen, Modelling and Simulations, Process Design, Rolling Horizon Optimization, Scheduling
Grid-connected electrolyzers with intermediate hydrogen storage offer significant potential for reducing electricity costs through flexible operation under dynamic pricing. A threshold-based scheduling optimization approach is developed that derives interpretable on/off production rules from electricity price signals. The method identifies local price thresholds separating high-price from low-price periods, yielding binary production schedules. Adaptive horizon partitioning-subdividing the scheduling horizon when constant thresholds become infeasible-is combined with a receding horizon strategy that implements only a portion of each optimized schedule before re-optimization. This procedure enables systematic investigation of how characteristics of Integrated Electrolyzer-Storage Systems (IESS) influence cost reduction potential while maintaining computational tractability for both offline analysis and online implementation. A case study applying the approach to historical German electr... [more]
Auxiliary flexibility in an integrated green steel plant participating in Day-ahead and Intra-day electricity markets
Santeri Vaara, Iiro Harjunkoski
June 12, 2026 (v1)
Keywords: Energy Management, Optimization, Process Operations, Scheduling
In the pursuit of decarbonisation, process industries are turning to electrification as a solution to avoid fossil fuels for heating and processing raw material. Transitioning to renewable electricity couples the processes to varying electricity availability and requires more consideration for production timing and scheduling to support grid stability and avoid high electricity prices. However, practical challenges limit the capability for unforeseen rescheduling for large processes. This paper explores the idea of auxiliary flexibility in an electrified steel production process, where only the auxiliary systems can react to changing conditions. We model an H2-DRI-EAF inspired process with controllable Air-Separation unit, water electrolysis, pressurized hydrogen storage, gas liquefaction units, and a battery energy storage system to react to a production related demand delay. First, we compare hourly and 15-minute DA pricing and observe that without fast flexibility the cost differenc... [more]
A framework for dynamic rescheduling under disruptions and resource constraints
David Robins, Farshid Babaei, Joan Cordiner, Solomon F. Brown
June 12, 2026 (v1)
Manufacturing disruptions can be a major driving factor in the wastage of resources and delays which result in spiralling costs and cancelled orders. Operational decision making should therefore consider the potential for disruptions from as many sources as possible, encouraging improvements to operational resilience and agility. Our work presents a scheduling and rescheduling framework formulated as a rolling horizon problem for the emulation of real time decision making within a dynamically changing scenario. The framework is applied to a complex multistage problem with parallel lines susceptible to disruptions as a result of process or equipment failures, or ineffective inventory management that results in material shortages. The framework is demonstrated for a simple example case which highlights the impact of disruptions on the time taken to complete orders and the associated costs. It is observed that the inclusion of disruptions can alter equipment congestion, shifting focus for... [more]
Rolling-Horizon Scheduling for Dynamic Market-Driven Operation of an Air Separation Plant
Kieran McKenzie, Christopher L. E. Swartz
June 12, 2026 (v1)
Keywords: Air Separation, Dynamic Optimization, Neural Network, Principal Component Analysis, Rolling-horizon, Scheduling, Surrogate Modeling
Cryogenic air separation units (ASUs) are the primary industrial technology for producing high purity oxygen, nitrogen, and argon gases at commercial scale. Cryogenic ASUs are large consumers of electricity, making them ideal candidates for market-driven operation research in today's volatile and uncertain manufacturing environments. To maximize profitability, ASU operation must dynamically adapt to changing market conditions as they evolve. This work explores the implementation of a rolling-horizon scheduling (RHS) strategy for the real-time market-driven operation of a high-dimensional ASU model with inventory, responding to uncertainty in future plant demand and electricity price forecasts by periodically rescheduling in response to updated market information. A dynamic latent variable-based surrogate model (LV-SM) is used within the scheduling framework as a computationally efficient substitute for an existing first-principles-based ASU model. Results show that RHS and plant invent... [more]
Multi-Level Optimization of Crane Scheduling
Sophia Onyshkevych, Bianca Springub, Christos Galanopoulos
June 12, 2026 (v1)
Keywords: Industry 40, Modelling, Optimization, Process Operations, Pyomo, Scheduling
Copper refining via electrolysis is a core metallurgical process that takes place in tankhouses, subject to strict temporal, spatial, and operational constraints. The efficiency and stability of this process depend critically on the coordinated scheduling of crane operations responsible for handling anodes, cathodes, and auxiliary tasks. In industrial practice, crane scheduling must simultaneously satisfy long-term production targets and short-term operational feasibility, while respecting process-dependent timing constraints imposed by electrochemical parameters. Inefficient or inconsistent schedules can lead to process delays, suboptimal resource utilization, and degraded electrolysis performance, ultimately affecting product quality and operational stability. This paper presents a modeling approach for optimizing tankhouse operations. The uniqueness of this case lies in the broad range of constraints, including human capacity, energy restrictions, metallurgical rules, and logistical... [more]
Integrated Operating Strategies and Parameter Optimization for PEM Electrolyzers in Power-to-X Energy Systems Luka Bornemanna*, Yifan Wangb, and Martin Kaltschmitta
Luka Bornemann, Yifan Wang, Martin Kaltschmitt
June 12, 2026 (v1)
"Green" hydrogen production via polymer electrolyte membrane (PEM) electrolyzers must overcome significant energy penalties and high costs to become competitive in renewables-based energy systems. Adaptive operating strategies for PEM electrolyzers-by dynamically adjusting current density, pressure, and temperature-have demonstrated efficiency improvements in simple energy systems. However, their effectiveness in the context of complex power-to-X energy systems featuring variable downstream synthesis processes remains unclear. This work shows that integrated optimization of PEM electrolyzer operating parameters in conjunction with downstream methanation processes (MP) delivers substantial system-wide efficiency and cost benefits under dynamic hydrogen demand and pressure conditions. To demonstrate this, an equation-oriented process model of a PEM electrolysis system is embedded within a higher-level energy system model to compare sequential optimization (where the electrolyzer adapts t... [more]
Data for: Set-based Formulations for the State Task Network Scheduling Problem
David A. Liñán, Georgia Stinchfield, Carl D. Laird, Jan Kronqvist
January 15, 2026 (v1)
This supplementary material contains tables and figures with the data necessary to replicate the results described in the manuscript.
Source code for: Set-based Formulations for the State Task Network Scheduling Problem
David A. Liñán, Georgia Stinchfield, Carl D. Laird, Jan Kronqvist
March 29, 2026 (v2)
The source code contains a run_experiments.sh script, which can be used to replicate the results described in the manuscript.
Mobile on-Demand (MOD) mRNA Vaccine Production: A Design and Optimal Location Study
Steffen Fahr, Lukas Thiel, Carl Sengoba
September 9, 2025 (v1)
Keywords: Batch Process, Modular Processes, mRNA Vaccine, Plant Layout, Scheduling
Vaccines are typically produced in large facilities to take advantage of economies of scale. However disease outbreaks are often local in nature and require flexible, small-scale production, especially in regions with poor infrastructure. In this work, mobile on-demand vaccine production is explored as a solution to future outbreaks. An mRNA vaccine process is scaled down to the size of two 20-foot shipping containers, so that 10,000 vaccine doses can be produced in one batch in less than 16 hours. The container is self-sufficient except for the regular resupply of water and electricity being able to produce 100 batches without resupply raw materials and consumables. The final cost per dose is estimated to be 25 e with a likely range between 4 to 45 e depending on dose size, raw material prices, and other underlying assumptions. The practicality of a container-based facility at the presented scale is demonstrated by two case studies.
Solving Complex Combinatorial Optimization Problems Using Quantum Annealing Approaches
Vasileios K. Mappas, Bogdan Dorneanu, Harvey Arellano-Garcia
June 27, 2025 (v1)
Keywords: Algorithms, Optimization, Quantum Annealing, Quantum Computing, Scheduling
Currently, state-of-the-art approaches to solving complex optimization problems have focused solely on methods requiring high computational time and unable to find the global optimal solution. In this work, a methodology based on quantum computing is presented to overcome these drawbacks. The novelty of this framework stems from the quantum computer’s architecture and taking into consideration the quantum phenomena that take place to solve optimization problems with specific structure. The proposed methodology includes steps for the transformation of the initial optimization problem into an unconstrainted optimization problem with binary variables and its embedding onto a quantum device. Moreover, different resolution levels for the transformation step and different architectures for the embedding process are utilized. To illustrate the procedure, a case study based on Haverly’s pooling and blending problem is examined while demonstrating the potential of the proposed approach. The res... [more]
A Digital Scheduling Hub for Natural Gas Processing: a Petrobras Case-Study Using Rigorous Process Simulation
Tayná E. G. Souza, Letícia C. dos Santos, Caio R. Soares
June 27, 2025 (v1)
Keywords: Modelling and Simulations, Natural Gas, Planning, Planning & Scheduling, Scheduling
To address the dynamic operational demands of the gas processing sector, which is continuously evolving due to gas market opening, increase in natural gas production, and the growing challenge of upstream-midstream integration in a competitive environment, this work presents the Integrated-Gas-Scheduling-System, IntegraGAS. The proposed methodology innovates by using first principles rigorous process simulation coupled with a scheduling tool for short/medium/long-term, enabling gas plants to swiftly adapt to varying operational conditions and meet the requirements of this new market. IntegraGAS was implemented in Petrobras and has significantly enhanced scheduling efficiency, reducing execution time by up to 99.2% and avoiding approx. US$ 2.3 million in annual labor costs, optimizing resource utilization. By integrating Excel for the frontend, Aspen HYSYS for process simulation, VBA for automation, and Microsoft PowerBI for real-time data visualization, IntegraGAS improves decision-mak... [more]
Optimization models and algorithms for the Unit Commitment problem
Javal Vyas, Carl Laird, Ignacio E. Grossmann, Ricardo M. Lima, Iiro Harjunkoski, Jan Poland
June 27, 2025 (v1)
The unit commitment problem determines the optimal strategy to meet the electricity demand at minimum cost by committing power generation units at each point of time. Solving the unit commitment problem gives rise to a challenging optimization problem due to its combinatorial complexity and potentially long solution time requirements. Our proposed solution approach utilizes a decomposition method in conjunction with alternative models from the EGRET library. Results of this decomposition approach tested against four benchmarking systems show that significant computational speed ups are achieved.
A Novel Global Sequence-based Mathematical Formulation for Energy-efficient Flexible Job Shop Scheduling Problem
D. Li, T.C. Zheng, J. Li
June 27, 2025 (v1)
With increasing emphasis on energy efficiency, more researchers are focusing on energy-efficient flexible job shop scheduling problems. Mathematical programming is a commonly used optimization method for such scheduling challenges, offering the advantages of achieving global optima and serving as a foundation for other approaches. However, current mathematical programming formulations face several challenges, including insufficient consideration of various forms of energy consumption and low efficiency, particularly in handling large-scale instances, which struggle to converge. In this study, we propose a novel global sequence-based approach with high computational efficiency. In this model, immediate precedence relationships are identified using constraints, enabling the precise determination of idle durations within any idle slots. The proposed formulation achieves a significant reduction in energy consumption by up to 20% relative to other formulations. Furthermore, it successfully... [more]
Enhancing Large-Scale Production Scheduling Using Machine-Learning Techniques
Maria E. Samouilidou, Nikolaos Passalis, Georgios P. Georgiadis, Michael C. Georgiadis
June 27, 2025 (v1)
Keywords: Industry 40, Machine Learning, MILP, Optimization, Scheduling
This study focuses on optimizing production scheduling in multi-product plants with shared resources and costly changeover operations. Specifically, two main challenges are addressed, the unknown changeover behavior of new products and the need for rapid schedule generation after unforeseen events. An innovative framework integrating Machine Learning (ML) techniques with Mixed-Integer Linear Programming (MILP) is proposed for single-stage production processes. Initially, a regression model predicts unknown changeover times based on key product attributes. Then, a representation where distances correlate with changeover times is compiled through multidimensional scaling, allowing constrained clustering to group production orders according to available packing lines. Ultimately, the MILP model generates the production schedule within a constrained solution space, utilizing optimal product-to-line allocation from cluster segmentation. A case study inspired by a Greek construction material... [more]
Scheduling of Automated Wet-Etch Stations with One Robot in Semiconductor Manufacturing via Constraint Answer Set Programming
Carmen L. García-Mata, Larysa Burtseva, Frank Werner
August 23, 2024 (v1)
Keywords: constraint answer set programming, knowledge representation and reasoning, Optimization, Scheduling, semiconductor manufacturing systems
Scheduling and optimization have a central place in the research area of computing because it is increasingly important to achieve fully automated production processes to adjust manufacturing systems to the requirements of Industry 4.0. In this paper, we demonstrate how an automated wet-etch scheduling problem for the semiconductor industry can be solved by constraint answer set programming (CASP) and its solver called clingcon. A successful solution to this problem is achieved, and we found that for all tested problems, CASP is faster and obtains smaller makespan values for seven of the eight problems tested than the solutions based on mixed integer linear programming and constraint paradigms. The considered scheduling problem includes a robot for lot transfers between baths. CASP is a hybrid approach in automated reasoning that combines different research areas such as answer set programming, constraint processing, and Satisfiability Modulo Theories. For a long time, exact methods su... [more]
Reduce Product Surface Quality Risks by Adjusting Processing Sequence: A Hot Rolling Scheduling Method
Tianru Jiang, Nan Zhang, Yongyi Xie, Zhimin Lv
August 23, 2024 (v1)
Keywords: hot rolled strip, hot rolling process, product surface quality, Scheduling, Weibull distribution
The hot rolled strip is a basic industrial product whose surface quality is of utmost importance. The condition of hot rolling work rolls that have been worn for a long time is the key factor. However, the traditional scheduling method controls risks to the surface quality by setting fixed rolling length limits and penalty scores, ignoring the wear condition differences caused by various products. This paper addresses this limitation by reconstructing a hot rolling-scheduling model, after developing a model for pre-assessment of the risk to surface quality based on the Weibull failure function, the deformation resistance formula, and real production data from a rolling plant. Additionally, Ant Colony Optimization (referred to as ACO) is employed to implement the scheduling model. The simulation results of the experiments demonstrate that, compared to the original scheduling method, the proposed one significantly reduces the cumulative risk of surface defects on products. This highlight... [more]
A Sequential Hybrid Optimization Algorithm (SHOA) to Solve the Hybrid Flow Shop Scheduling Problems to Minimize Carbon Footprint
M. Geetha, R. Chandra Guru Sekar, M. K. Marichelvam, Ömür Tosun
June 21, 2024 (v1)
Keywords: carbon footprint, firefly algorithm (FA), hybrid flow shop, pigeon-inspired optimization algorithm (PIOA), Scheduling
In today’s world, a situational awareness of sustainability is becoming increasingly important. Leaving a better world for future generations is becoming the main interest of many studies. It also puts pressure on managers to change production methods in most industries. Reducing carbon emissions in industry today is crucial to saving our planet. Theoretical research and practical industry requirements diverge, even though numerous researchers have tackled various strategies to handle carbon emission problems. Therefore, this work considers the carbon emission problem of the furniture manufacturing industry in Hosur, Tamilnadu, India. The case study company has a manufacturing system that resembles a hybrid flow shop (HFS) environment. As the HFS scheduling problems are NP-hard in nature, exact solution techniques could not be used to solve the problems. Hence, a sequential hybrid optimization algorithm (SHOA) has been developed in this paper to minimize the carbon footprint. In the SH... [more]
Scheduling Jobs with a Limited Waiting Time Constraint on a Hybrid Flowshop
Sang-Oh Shim, BongJoo Jeong, June-Yong Bang, JeongMin Park
July 13, 2023 (v1)
Keywords: diffusion workstation, hybrid flowshop, limited waiting time, Scheduling, semiconductor fabrication
In this paper, we address a two-stage hybrid flowshop scheduling problem with identical parallel machines in each stage. The problem assumes that the queue (Q)-time for each job, which represents the waiting time to be processed in the current stage, must be limited to a predetermined threshold due to quality concerns for the final product. This problem is motivated by one that occurs in the real field, especially in the diffusion workstation of a semiconductor fabrication. Our objective is to minimize the makespan of the jobs while considering product quality. To achieve this goal, we formulated mathematical programming, developed two dominance properties for this problem, and proposed three heuristics with the suggested dominance properties to solve the considered problem. We conducted simulation experiments to evaluate the performance of the proposed approaches using randomly generated problem instances that are created to closely resemble real production scenarios, and the results... [more]
Group Technology Scheduling with Due-Date Assignment and Controllable Processing Times
Weiguo Liu, Xuyin Wang
April 28, 2023 (v1)
Keywords: controllable processing times, group technology, position-dependent weights, Scheduling, single-machine
This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimizes scheduling (including the weighted sum of earliness, tardiness, and due-date assignment, where the weights are position-dependent) and resource-allocation costs. Given some optimal properties of the problem, if the size of jobs in each group is identical, the optimal group sequence can be obtained via an assignment problem. We then illustrate that the problem is polynomially solvable in O(℘3) time, where ℘ is the number of jobs.
Application of Neuro-Fuzzy Techniques for Energy Scheduling in Smart Grids Integrating Photovoltaic Panels
Otilia Elena Dragomir, Florin Dragomir, Marius Păun, Octavian Duca, Ion Valentin Gurgu, Ioan-Cătălin Drăgoi
April 28, 2023 (v1)
Keywords: loads, neuro-fuzzy, power generation, renewable energy sources, Scheduling
In recent years, most of the research in the field of smart grids integrating renewable energy sources assumed energy efficiency as a scheduling objective. However, the aspects of energy consumption or energy demand have not been described clearly, even though they have been proven to be an effective way of reducing energy consumption. In this context, this study aimed to cover a key research challenge in the field, such as the development of an intelligent strategy for solving energy consumption scheduling problems. The added value of our proposal consists of classifying individual consumption profiles assigned to each operation cycle phase, instead of considering an average of non-varying consumption of household appliances. Within this hybrid approach, the proposed explainable system, based on self-organizing maps of neural networks, fuzzy clustering algorithm, and scheduling technics, correlates the complex interrelation between power generated from renewable energy sources in a sm... [more]
Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems
Alejandro Santiago, Mirna Ponce-Flores, J. David Terán-Villanueva, Fausto Balderas, Salvador Ibarra Martínez, José Antonio Castan Rocha, Julio Laria Menchaca, Mayra Guadalupe Treviño Berrones
April 20, 2023 (v1)
Keywords: directed acyclic graph (DAG), energy aware, energy idle, local search, makespan, Scheduling
The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost. Task scheduling is an NP-Hard problem; thus, several heuristics methods appear in the literature. The main approaches can be grouped into the following categories: fast heuristics, metaheuristics, and local search. Fast heuristics and metaheuristics are used when pre-scheduling times are short and long, respectively. The third is commonly used when pre-scheduling time is limited by CPU seconds or by objective function evaluations. This paper focuses on optimizing the scheduling of parallel applications, considering the energy consumption during the idle time while no tasks are executing. Additionally, we detail a comparative literature study of the performance of lexicographic variants with local searches adapted to be stochastic and aware of idle ener... [more]
An Optimization Based Power Usage Scheduling Strategy Using Photovoltaic-Battery System for Demand-Side Management in Smart Grid
Sajjad Ali, Imran Khan, Sadaqat Jan, Ghulam Hafeez
April 19, 2023 (v1)
Keywords: battery energy storage systems, demand response, energy management, photovoltaic, Scheduling, smart grid
Due to rapid population growth, technology, and economic development, electricity demand is rising, causing a gap between energy production and demand. With the emergence of the smart grid, residents can schedule their energy usage in response to the Demand Response (DR) program offered by a utility company to cope with the gap between demand and supply. This work first proposes a novel optimization-based energy management framework that adapts consumer power usage patterns using real-time pricing signals and generation from utility and photovoltaic-battery systems to minimize electricity cost, to reduce carbon emission, and to mitigate peak power consumption subjected to alleviating rebound peak generation. Secondly, a Hybrid Genetic Ant Colony Optimization (HGACO) algorithm is proposed to solve the complete scheduling model for three scenarios: without photovoltaic-battery systems, with photovoltaic systems, and with photovoltaic-battery systems. Thirdly, rebound peak generation is r... [more]
Showing records 1 to 25 of 70. [First] Page: 1 2 3 Last
(0.06 seconds)
[Show All Keywords]

[0.07 s]