Synchronizing production planning and job scheduling: MILP models and exact algorithms

We address the synchronization of a resource production process with the consumption of related resources by jobs. Both processes interact through transfer transactions , which become the key components of the resulting scheduling problem. This Synchronized Resource Production/Job Processing problem...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of combinatorial optimization Ročník 50; číslo 1; s. 2
Hlavní autoři: Mombelli, Aurélien, Quilliot, Alain
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2025
Springer Nature B.V
Témata:
Algorithms
Benders decomposition
Collaboration
Combinatorics
Convex and Discrete Geometry
Decomposition
Energy
Hypotheses
Integer programming
Linear programming
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Mixed integer
Operations Research/Decision Theory
Optimization
Production costs
Production planning
Production scheduling
Robots
Scheduling
Storage tanks
Synchronism
Theory of Computation
Vehicles
Scheduling
90-10
Brand and cut
A path search algorithm
90C11
Bender’s decomposition
ISSN:1382-6905, 1573-2886
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We address the synchronization of a resource production process with the consumption of related resources by jobs. Both processes interact through transfer transactions , which become the key components of the resulting scheduling problem. This Synchronized Resource Production/Job Processing problem ( SRPJP ) problem typically arises when the resource is a form of renewable energy (e.g., hydrogen, photovoltaic) stored in tanks or batteries. We first cast SRPJP into the Mixed-Integer Linear Programming (MILP) format and handle it through a branch-and-cut process involving specific No _ Antichain constraints derived from the structure of the feasible transfer transactions . Subsequently, we explore another approach, which involves eliminating non-binary decision variables and applying a Benders decomposition scheme. Finally, we reformulate the SRPJP problem as a path search problem, which we efficiently handle by designing a tailored adaptation of the A* algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-025-01326-y