Efficient Data-Driven Production Scheduling in Pharmaceutical Manufacturing
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915798454370304 |
|---|---|
| author | Balatsos, Ioannis Liakos, Athanasios Karakostas, Panagiotis Song, Tao Pantazopoulos, Vassilios Papalitsas, Christos |
| author_facet | Balatsos, Ioannis Liakos, Athanasios Karakostas, Panagiotis Song, Tao Pantazopoulos, Vassilios Papalitsas, Christos |
| contents | This paper develops a data-driven, constraint-based optimization framework for a complex industrial job shop scheduling problem variant in pharmaceutical manufacturing. The formulation captures fixed routings and designated machines, explicit resource calendars with weekends and planned maintenance, and campaign sequencing through sequence-dependent cleaning times derived from site tables. The model is implemented with an open source constraint solver and evaluated on deterministic snapshots from a solid oral dosage facility under three objective formulations: makespan, makespan plus total tardiness, and makespan plus average tardiness. On three industrial instances of increasing size (10, 30, and 84 jobs) the proposed schedules dominate reference plans that solve a simplified variant without the added site rules. Makespan reductions reach \(88.1\%\), \(77.6\%\), and \(54.9\%\) and total tardiness reductions reach \(72.1\%\), \(58.7\%\), and \(18.2\%\), respectively. The composite objectives further decrease late job counts with negligible makespan change on the smaller instances and a modest increase on the largest instance. Optimality is proven on the small case, with relative gaps of \(0.77\%\) and \(14.92\%\) on the medium and large cases under a fixed time limit. The results show that a compact constraint programming formulation can deliver feasible, transparent schedules that respect site rules while improving adherence to due dates on real industrial data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_13668 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient Data-Driven Production Scheduling in Pharmaceutical Manufacturing Balatsos, Ioannis Liakos, Athanasios Karakostas, Panagiotis Song, Tao Pantazopoulos, Vassilios Papalitsas, Christos Performance This paper develops a data-driven, constraint-based optimization framework for a complex industrial job shop scheduling problem variant in pharmaceutical manufacturing. The formulation captures fixed routings and designated machines, explicit resource calendars with weekends and planned maintenance, and campaign sequencing through sequence-dependent cleaning times derived from site tables. The model is implemented with an open source constraint solver and evaluated on deterministic snapshots from a solid oral dosage facility under three objective formulations: makespan, makespan plus total tardiness, and makespan plus average tardiness. On three industrial instances of increasing size (10, 30, and 84 jobs) the proposed schedules dominate reference plans that solve a simplified variant without the added site rules. Makespan reductions reach \(88.1\%\), \(77.6\%\), and \(54.9\%\) and total tardiness reductions reach \(72.1\%\), \(58.7\%\), and \(18.2\%\), respectively. The composite objectives further decrease late job counts with negligible makespan change on the smaller instances and a modest increase on the largest instance. Optimality is proven on the small case, with relative gaps of \(0.77\%\) and \(14.92\%\) on the medium and large cases under a fixed time limit. The results show that a compact constraint programming formulation can deliver feasible, transparent schedules that respect site rules while improving adherence to due dates on real industrial data. |
| title | Efficient Data-Driven Production Scheduling in Pharmaceutical Manufacturing |
| topic | Performance |
| url | https://arxiv.org/abs/2602.13668 |