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

Aurélien Mombelli and Alain Quilliot ()
Additional contact information
Aurélien Mombelli: LIMOS CNRS / INP Université Clermont-Auvergne
Alain Quilliot: LIMOS CNRS / INP Université Clermont-Auvergne

Journal of Combinatorial Optimization, 2025, vol. 50, issue 1, No 2, 21 pages

Abstract: Abstract 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.

Keywords: Scheduling; Brand and cut; Bender’s decomposition; A* path search algorithm; 90-10; 90C11 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01326-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01326-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01326-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().