pith. sign in

arxiv: 2604.21029 · v1 · submitted 2026-04-22 · 🧮 math.OC · cs.AI

Integrated packing, placement, scheduling, and routing of personalized production: a pharmaceutical Industry 4.0 use-case with a planar transport system

Viktor Emil Korladinov , Antonin Novak , Zden\v{e}k Hanz\'alek , Erik Sonntag , Franti\v{s}ek \v{S}t\v{e}p\'anek This is my paper

Pith reviewed 2026-05-09 23:31 UTC · model grok-4.3

classification 🧮 math.OC cs.AI
keywords personalized pharmaceutical productionplanar transport systemsmixed-integer quadratic programmingconstraint programmingpacking and placementscheduling and routingIndustry 4.0flexible manufacturing systems
0
0 comments X

The pith

A framework integrates mixed-integer and constraint programming to schedule personalized drug production on planar transport systems for up to 500 daily orders.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops an integrated optimization framework for automated personalized pharmaceutical production on a planar transport system that allows movers full two-dimensional freedom on a tile grid. Tactical decisions first pack drugs that frequently co-occur in prescriptions using a mixed-integer quadratic program, then position the resulting dispenser groups through a bi-level assignment and path problem that minimizes expected mover travel. Operational decisions schedule new daily orders by modeling movers as reservoir resources in a constraint program, followed by an iterative routing phase that converts the schedule into conflict-free paths via DAG reasoning. Tests on real prescription data for 40 drugs confirm the approach produces effective schedules that remain computationally tractable across multiple layout topologies.

Core claim

The authors establish that a combined tactical-operational pipeline—mixed-integer quadratic programming for co-occurrence-based packing, bi-level placement via assignment plus shortest Hamiltonian paths with neighborhoods, constraint programming scheduling with movers modeled as reservoir resources, and iterative conflict-resolution routing using DAG reasoning—solves the simultaneous logistics and production scheduling problem for personalized drug manufacturing and yields tractable, high-quality solutions for instances up to 500 orders.

What carries the argument

The bi-level placement problem that combines an assignment problem with shortest Hamiltonian paths with neighborhoods, following from co-occurrence packing and feeding into reservoir-based constraint programming scheduling.

If this is right

  • Dispenser layouts chosen by the bi-level placement model reduce expected mover travel distances across the grid.
  • Constraint programming schedules using reservoir resources guarantee that every order is completed before the next set of movers is released.
  • Iterative conflict-resolution with DAG reasoning converts any feasible schedule into a set of non-colliding paths.
  • Multiple layout topologies can be evaluated and compared for operational effectiveness within the same tactical planning step.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same separation of tactical packing-placement from operational scheduling could be reused in other flexible manufacturing domains that combine custom item assembly with mobile resources.
  • If prescription patterns drift, the tactical layer would need periodic re-execution to keep the placement decisions aligned with current order statistics.
  • The DAG-based conflict-resolution step may generalize to other multi-agent routing settings that must respect time windows and resource capacities.

Load-bearing premise

Historical patient prescription patterns remain stable enough to justify the tactical packing and placement decisions, and the planar movers can operate without unmodeled physical constraints or failures.

What would settle it

Running the full pipeline on a fresh prescription dataset whose co-occurrence statistics differ markedly from the historical data and checking whether the resulting daily schedules exceed practical time limits or produce infeasible mover paths.

Figures

Figures reproduced from arXiv: 2604.21029 by Antonin Novak, Erik Sonntag, Franti\v{s}ek \v{S}t\v{e}p\'anek, Viktor Emil Korladinov, Zden\v{e}k Hanz\'alek.

Figure 2
Figure 2. Figure 2: Diagram of the proposed solution and mutual interactions of its components. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Tile-drug matrix represents values of variables [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Expected tile utilization with individual dispensers’ contributions. [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Examples of considered layout topologies. Highlighted tiles display an example of a possible placement of interface [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Example of the considered placement in the example square layout [PITH_FULL_IMAGE:figures/full_fig_p011_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Placement solution corresponding to a feasible instance of [PITH_FULL_IMAGE:figures/full_fig_p012_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: A solution of placement problem where q steps of a mover fulfills the order drug requirements U. Note that when we allow the packing of at most 2 dispensers onto the same tile, the above reduction would no longer hold, as the Exact 2-Cover (covering by sets with exactly two elements) is polynomially solvable—can be reduced to 2-SAT, which is polynomially solvable (Garey & Johnson, 1979). Thus, this leaves … view at source ↗
Figure 9
Figure 9. Figure 9: The scheduler maps input operations (left) to an optimized assigned schedule (right). Depicted intervals represent [PITH_FULL_IMAGE:figures/full_fig_p017_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Visualization of dispensing maneuver. Geometrically, a mover with dimensions [PITH_FULL_IMAGE:figures/full_fig_p021_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: The yellow areas represent selected resting sites [PITH_FULL_IMAGE:figures/full_fig_p021_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Optimized schedule s, identification of its idle periods and their assignment 7.2. Resting Sites Assignment The problem of assigning each mover’s idle period to a resting site in the schedule s is formulated as a Mixed-Integer Programming model. The model takes as input the set of precomputed resting sites R = {r1, r2, . . . , rk}, the set of movers M = {m1, m2, . . . , mnmovers }, and the set of transits… view at source ↗
Figure 13
Figure 13. Figure 13: DAG generated from the schedule in Figure 12a. Black edges represent same-mover precedence constraints, blue [PITH_FULL_IMAGE:figures/full_fig_p023_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Robustness and stability analysis of the tactical level across varying mover configurations and layout topologies. [PITH_FULL_IMAGE:figures/full_fig_p025_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Correlation of placement and scheduling objective. [PITH_FULL_IMAGE:figures/full_fig_p026_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Effect of mover count on Cmax for different topologies (64 tiles each) with varying dispensing speeds. 0 1,000 2,000 0 2,000 4,000 6,000 time [s] Cmax [-] 0 1,000 2,000 0 10,000 20,000 30,000 time [s] |P| : 10 20 50 100 200 300 500 [PITH_FULL_IMAGE:figures/full_fig_p027_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: The effect of the time limit on Cmax for different sizes of P on a square 8 × 8 ∼ 2 topology. The results for order sets with 100 or fewer orders show diminishing improvements in makespan with longer run times. Time limits of around 300 seconds appear to be sufficient for practical reasons across all order set sizes. Figure 17b illustrates the impact of instance size on problem complexity. For larger orde… view at source ↗
Figure 18
Figure 18. Figure 18: The effect of the time limit on Cmax for different batch sizes. Square 8 × 8 ∼ 2 layout, 8 movers. The results demonstrate that partitioning the problem into smaller batches is an effective strategy for scaling to larger order sets. Although this decomposition introduces minor suboptimalities for smaller instances, it substantially improves computational efficiency. For larger instances, the method attain… view at source ↗
read the original abstract

The recent emergence of planar transport systems necessitates re-evaluation of Flexible Manufacturing Systems (FMS) to address the simultaneous scheduling of internal logistics and production operations. By operating on a tile-based planar grid, these systems allow independent movers full two-dimensional freedom, mitigating inefficiencies inherent to traditional sequential lines. This paper applies a planar FMS framework to a real-world use case in the pharmaceutical industry: the automated production of personalized drugs. Implementing this system requires solving optimization problems at both tactical and operational levels. The tactical level involves decisions regarding production line layout and the positioning of drug dispensers. A Mixed-Integer Quadratic Programming model is utilized for the packing problem to exploit drug co-occurrence patterns found in historical patient data. Subsequently, we solve the placement problem - a bi-level problem combining an assignment problem with Shortest Hamiltonian paths with neighborhoods - to arrange dispensers in a layout minimizing expected travel distances. The operational level is encountered daily, scheduling individual movers to process new orders as quickly as possible. This scheduling problem is formulated using Constraint Programming, modeling movers as reservoir resources to ensure order completeness, complemented by a routing phase using an iterative conflict-resolution mechanism and DAG-based reasoning to convert schedules into conflict-free paths. Evaluation using real-world prescription data for 40 drugs shows the framework scales efficiently across several layout topologies for up to 500 orders, with schedules that are highly effective and computationally tractable for daily operations.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 1 minor

Summary. The paper proposes an integrated optimization framework for personalized pharmaceutical production on planar transport systems. At the tactical level, a Mixed-Integer Quadratic Program exploits historical drug co-occurrence patterns for packing, followed by a bi-level placement model (assignment plus shortest Hamiltonian paths with neighborhoods) to position dispensers. At the operational level, Constraint Programming schedules movers (modeled as reservoir resources) and an iterative conflict-resolution plus DAG-based routing produces conflict-free paths. Evaluation on real prescription data for 40 drugs reports that the framework scales efficiently across layout topologies for up to 500 orders and yields computationally tractable schedules suitable for daily operations.

Significance. If the reported scalability and effectiveness hold under the stated modeling assumptions, the work would provide a concrete, solver-based template for Industry 4.0 flexible manufacturing in a regulated sector. The combination of data-driven tactical layout with operational CP scheduling on a planar grid is novel for this application and could inform similar reconfigurable production systems. The use of real-world prescription data and emphasis on daily computational tractability are positive features.

major comments (3)
  1. [Abstract] Abstract (evaluation paragraph): The claim that schedules are 'highly effective' is not supported by any quantitative performance metrics, baseline comparisons, or statistical tests; only qualitative statements and scalability statements appear. Without these, the effectiveness assertion cannot be assessed and is load-bearing for the operational contribution.
  2. [Abstract] Abstract and evaluation description: No sensitivity analysis, forward-validation on held-out or synthetic future prescription data, or re-optimization mechanism is reported for the MIQP packing and bi-level placement steps that rely on historical co-occurrence statistics. This stationarity assumption is central to the tactical decisions remaining effective in ongoing operations.
  3. [Abstract] Abstract: The manuscript provides only high-level outlines of the MIQP packing model, bi-level placement formulation, and CP scheduling model; full objectives, constraints, parameter settings, and solver configurations are absent. This prevents verification or reproduction of the claimed scalability results.
minor comments (1)
  1. [Abstract] The abstract would benefit from explicit numerical results (e.g., average makespan, CPU times, or optimality gaps) rather than qualitative descriptors.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive and detailed comments, which highlight important aspects for improving the clarity, reproducibility, and robustness of our work. We address each major comment below and commit to revisions that strengthen the manuscript without altering its core contributions.

read point-by-point responses

  1. Referee: [Abstract] Abstract (evaluation paragraph): The claim that schedules are 'highly effective' is not supported by any quantitative performance metrics, baseline comparisons, or statistical tests; only qualitative statements and scalability statements appear. Without these, the effectiveness assertion cannot be assessed and is load-bearing for the operational contribution.

    Authors: We agree that the abstract's phrasing requires quantitative grounding to support the effectiveness claim. The evaluation section reports concrete results on makespan, utilization, and daily tractability across 500 orders, but these are not summarized numerically in the abstract. In the revision we will replace the qualitative statement with specific metrics (e.g., average makespan, percentage improvement over a sequential baseline, and computation times) drawn directly from the experimental tables, while noting that the models are deterministic and therefore do not include statistical hypothesis tests. revision: yes

  2. Referee: [Abstract] Abstract and evaluation description: No sensitivity analysis, forward-validation on held-out or synthetic future prescription data, or re-optimization mechanism is reported for the MIQP packing and bi-level placement steps that rely on historical co-occurrence statistics. This stationarity assumption is central to the tactical decisions remaining effective in ongoing operations.

    Authors: The referee correctly identifies a limitation: the tactical models rely on historical co-occurrence without reported sensitivity or forward validation. We will add a dedicated subsection that (i) performs sensitivity analysis by perturbing the co-occurrence matrix within observed variance ranges, (ii) evaluates the resulting layouts on synthetic future data generated by shifting prescription frequencies, and (iii) outlines a practical re-optimization trigger (e.g., when new prescription batches arrive) that re-runs the MIQP and placement steps. These additions will be placed in the evaluation section and referenced from the abstract. revision: yes

  3. Referee: [Abstract] Abstract: The manuscript provides only high-level outlines of the MIQP packing model, bi-level placement formulation, and CP scheduling model; full objectives, constraints, parameter settings, and solver configurations are absent. This prevents verification or reproduction of the claimed scalability results.

    Authors: We acknowledge that the current high-level descriptions limit reproducibility. In the revised manuscript we will include the complete MIQP objective and constraint set, the full bi-level placement formulation (assignment plus shortest Hamiltonian paths with neighborhoods), and the CP model with reservoir resource semantics. A new appendix will tabulate all parameter values, solver settings (CP Optimizer search phases, time limits, tolerances), and hardware specifications used for the reported runs. These additions will allow direct verification of the scalability claims. revision: yes

Circularity Check

0 steps flagged

Standard optimization formulations with no load-bearing self-citation or definitional reduction

full rationale

The paper formulates a MIQP packing model that ingests historical co-occurrence statistics as input data, a bi-level placement model minimizing expected distances on the resulting layout, and a CP scheduling model with reservoir resources plus iterative routing. These are solved by external solvers (Gurobi, CP solvers) on up to 500 orders. Evaluation reports scaling and tractability metrics rather than any fitted parameter being renamed as a prediction. No equations reduce the output to the input by construction, and no uniqueness theorem or ansatz is imported via self-citation. The stationarity assumption on prescription patterns is an untested modeling choice but does not create circularity in the derivation chain itself.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no explicit free parameters, axioms, or invented entities; the approach relies on standard optimization formulations whose details are not visible.

pith-pipeline@v0.9.0 · 5596 in / 1100 out tokens · 40897 ms · 2026-05-09T23:31:59.400475+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

70 extracted references · 70 canonical work pages

  1. [1]

    1979 , publisher=

    Computers and intractability , author=. 1979 , publisher=

    work page 1979

  2. [2]

    INFOR: Information Systems and Operational Research , volume=

    An efficient transformation of the generalized traveling salesman problem , author=. INFOR: Information Systems and Operational Research , volume=. 1993 , publisher=

    work page 1993

  3. [3]

    Algorithmica , author =

    On approximating the longest path in a graph , volume =. Algorithmica , author =. 1997 , keywords =. doi:10.1007/BF02523689 , abstract =

    work page doi:10.1007/bf02523689 1997

  4. [4]

    Computers & Industrial Engineering , volume=

    Constraint programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers , author=. Computers & Industrial Engineering , volume=. 2022 , publisher=

    work page 2022

  5. [6]

    Annals of Operations Research , volume=

    Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources , author=. Annals of Operations Research , volume=. 2017 , publisher=

    work page 2017

  6. [7]

    Discrete Applied Mathematics , volume=

    Approximation algorithms for the geometric covering salesman problem , author=. Discrete Applied Mathematics , volume=. 1994 , publisher=

    work page 1994

  7. [9]

    URLhttps://doi.org/10.1609/aaai.v26i1.8140

    Conflict-Based Search For Optimal Multi-Agent Path Finding , volume=. Proceedings of the AAAI Conference on Artificial Intelligence , author=. 2021 , month=. doi:10.1609/aaai.v26i1.8140 , abstractNote=

    work page doi:10.1609/aaai.v26i1.8140 2021

  8. [10]

    Proceedings of the 12th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, , year=

    Antonin Novak and Matous Pikous and Zdenek Hanzalek , title=. Proceedings of the 12th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, , year=. doi:10.5220/0011784800003396 , isbn=

    work page doi:10.5220/0011784800003396

  9. [11]

    Expert Systems with Applications , volume=

    Combinatorial lower bounds for the generalized traveling salesman problem with neighborhoods , author=. Expert Systems with Applications , volume=. 2024 , publisher=

    work page 2024

  10. [13]

    and Moukrim, A

    Carlier, J. and Moukrim, A. and Sahli, A. , date =. Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources , volume =. doi:10.1016/j.dam.2016.05.021 , series =

    work page doi:10.1016/j.dam.2016.05.021 2016

  11. [14]

    Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints , volume =

    Karnebogen, Mareike and Zimmermann, Jürgen , date =. Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints , volume =. doi:10.1007/s10479-023-05788-3 , abstract =

    work page doi:10.1007/s10479-023-05788-3

  12. [17]

    Optimalizované umístění strojů pro výrobu personalizovaných více-komponentních léčiv , abstract =

    Balagazova, Karina , date =. Optimalizované umístění strojů pro výrobu personalizovaných více-komponentních léčiv , abstract =

    work page

  13. [18]

    Industry 4.0: a way from mass customization to mass personalization production , volume =

    Wang, Yi and Ma, Hai-Shu and Yang, Jing-Hui and Wang, Ke-Sheng , year =. Industry 4.0: a way from mass customization to mass personalization production , volume =. Advances in Manufacturing , doi =

    work page

  14. [21]

    Contributions to new variants of the open shop scheduling problem: modeling and solution methods , shorttitle =

    Abreu, Levi Ribeiro de and Nagano, Marcelo Seido , year =. Contributions to new variants of the open shop scheduling problem: modeling and solution methods , shorttitle =

    work page

  15. [22]

    Omega , volume=

    An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems , author=. Omega , volume=. 2013 , publisher=

    work page 2013

  16. [23]

    Omega , volume=

    A study on policy decisions to embed flexibility for reactive recovery in the planning and scheduling process in operating rooms , author=. Omega , volume=. 2024 , publisher=

    work page 2024

  17. [24]

    2021 , note=

    Lip Factory by Color Tailor: Smart Factory System , author=. 2021 , note=

    work page 2021

  18. [25]

    Artificial Intelligence , volume=

    Multi-agent pathfinding with continuous time , author=. Artificial Intelligence , volume=. 2022 , publisher=

    work page 2022

  19. [26]

    2022 , school=

    Path planning algorithm for levitating planar motion system , author=. 2022 , school=

    work page 2022

  20. [27]

    Path-Planning Algorithms for a Levitating Planar Motion System , author=

    work page

  21. [28]

    Frontiers in Control Engineering , volume=

    Conflict-based Model Predictive Control for Multi-agent Path Finding-Experimentally Validated on a Magnetic Planar Drive System , author=. Frontiers in Control Engineering , volume=. 2025 , publisher=

    work page 2025

  22. [29]

    and Morin, Lucas and Tan, Edwin C

    Wastesson, Jonas W. and Morin, Lucas and Tan, Edwin C. K. and Johnell, Kristina , title =. Expert Opinion on Drug Safety , volume =. 2018 , doi =

    work page 2018

  23. [30]

    Quinn, K. J. and Shah, N. H. , title =. Scientific Data , volume =. 2017 , doi =

    work page 2017

  24. [31]

    Sutherland, J. J. and Daly, T. M. and Liu, X. and Goldstein, K. and Johnston, J. A. and Ryan, T. P. , title =. PLOS ONE , volume =. 2015 , doi =

    work page 2015

  25. [32]

    and Kamalakkannan, G

    Bangalore, S. and Kamalakkannan, G. and Parkar, S. and Messerli, F. H. , title =. The American Journal of Medicine , volume =. 2007 , doi =

    work page 2007

  26. [33]

    and Rodriguez-Monguio, R

    Hao, J. and Rodriguez-Monguio, R. and Seoane-Vazquez, E. , title =. PLOS ONE , volume =. 2015 , doi =

    work page 2015

  27. [34]

    and Vervaet, C

    Vanhoorne, V. and Vervaet, C. , title =. International Journal of Pharmaceutics , volume =. 2020 , doi =

    work page 2020

  28. [35]

    Rossi, C. V. , title =. Journal of Pharmaceutical Innovation , volume =. 2022 , doi =

    work page 2022

  29. [36]

    and Almeida, I

    Carvalho, M. and Almeida, I. F. , title =. Pharmaceuticals , volume =. 2022 , doi =

    work page 2022

  30. [37]

    and Stepanek, F

    Sonntag, E. and Stepanek, F. and Vrba, J. and Mutylo, E. and Slezakova, S. , title =

    work page

  31. [38]

    and Navrátil, O

    Mutylo, E. and Navrátil, O. and Waněk, A. and Šembera, F. and Štěpánek, F. , title =. International Journal of Pharmaceutics , volume =. 2025 , doi =

    work page 2025

  32. [39]

    and Brosed Dueso, F

    Bianchi, E. and Brosed Dueso, F. J. and Yagüe-Fabra, J. A. , title =. Applied Sciences , volume =. 2024 , doi =

    work page 2024

  33. [40]

    and Zhang, L

    Wang, R. and Zhang, L. and Yang, K. , title =. Energies , volume =. 2024 , doi =

    work page 2024

  34. [41]

    2012 , howpublished =

    work page 2012

  35. [42]

    SIAM Journal on Computing , volume=

    Hamilton paths in grid graphs , author=. SIAM Journal on Computing , volume=. 1982 , publisher=

    work page 1982

  36. [43]

    IFAC-PapersOnLine , volume=

    Quality Analysis of Multi-Agent Multi-Item Pickup and Delivery Solutions Using a Decoupled Approach , author=. IFAC-PapersOnLine , volume=. 2022 , publisher=

    work page 2022

  37. [44]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Exact algorithms and lowerbounds for multiagent path finding: Power of treelike topology , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    work page

  38. [45]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Solving multiagent path finding on highly centralized networks , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    work page

  39. [46]

    author Abreu, L. R. d. , & author Nagano, M. S. ( year 2024 ). title Contributions to new variants of the open shop scheduling problem: modeling and solution methods \/ . Ph.D. thesis Universidade Federal do Ceará. note Publisher: Galoá

    work page 2024

  40. [47]

    , & author Maenhout, B

    author Akbarzadeh, B. , & author Maenhout, B. ( year 2024 ). title A study on policy decisions to embed flexibility for reactive recovery in the planning and scheduling process in operating rooms . journal Omega \/ , volume 126 \/ , pages 103061 . :10.1016/j.omega.2024.103061

    work page doi:10.1016/j.omega.2024.103061 2024

  41. [48]

    author Arkin, E. M. , & author Hassin, R. ( year 1994 ). title Approximation algorithms for the geometric covering salesman problem . journal Discrete Applied Mathematics \/ , volume 55 \/ , pages 197--218 . :10.1016/0166-218X(94)90008-6

    work page doi:10.1016/0166-218x(94)90008-6 1994

  42. [49]

    pymoo: Multi-Objective Optimization in Python,

    author Blank, J. , & author Deb, K. ( year 2020 ). title Pymoo: Multi-objective optimization in python . journal IEEE Access \/ , volume 8 \/ , pages 89497–89509 . :10.1109/access.2020.2990567

    work page doi:10.1109/access.2020.2990567 2020

  43. [50]

    , & author Almeida, I

    author Carvalho, M. , & author Almeida, I. F. ( year 2022 ). title The role of pharmaceutical compounding in promoting medication adherence . journal Pharmaceuticals \/ , volume 15 \/ , pages 1091 . :10.3390/ph15091091

    work page doi:10.3390/ph15091091 2022

  44. [51]

    Dauz` ere-P´ er` es, J

    author Dauzère-Pérès, S. , author Ding, J. , author Shen, L. , & author Tamssaouet, K. ( year 2024 ). title The flexible job shop scheduling problem: A review . journal European Journal of Operational Research \/ , volume 314 \/ , pages 409--432 . :https://doi.org/10.1016/j.ejor.2023.05.017

    work page doi:10.1016/j.ejor.2023.05.017 2024

  45. [52]

    , author V \'a n a, P

    author Deckerov \'a , J. , author V \'a n a, P. , & author Faigl, J. ( year 2024 ). title Combinatorial lower bounds for the generalized traveling salesman problem with neighborhoods . journal Expert Systems with Applications \/ , volume 258 \/ , pages 125185 . :10.1016/j.eswa.2024.125185

    work page doi:10.1016/j.eswa.2024.125185 2024

  46. [53]

    , author Knop, D

    author Fioravantes, F. , author Knop, D. , author K r i s tan, J. M. , author Melissinos, N. , & author Opler, M. ( year 2024 ). title Exact algorithms and lowerbounds for multiagent path finding: Power of treelike topology . In booktitle Proceedings of the AAAI Conference on Artificial Intelligence \/ (pp. pages 17380--17388 ). volume volume 38

    work page 2024

  47. [54]

    author Garey, M. R. , & author Johnson, D. S. ( year 1979 ). title Computers and intractability \/ volume volume 174 . publisher freeman San Francisco

    work page 1979

  48. [55]

    ( year 2021 )

    author Go, M.-j. ( year 2021 ). title Lip factory by color tailor: Smart factory system . note CES 2021 Innovation Awards Honoree, Amorepacific R&D Center

    work page 2021

  49. [56]

    , & author S u cha, P

    author Hanz \'a lek, Z. , & author S u cha, P. ( year 2017 ). title Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources . journal Annals of Operations Research \/ , volume 248 \/ , pages 209--237 . :10.1007/s10479-016-2184-6

    work page doi:10.1007/s10479-016-2184-6 2017

  50. [57]

    , author Rodriguez-Monguio, R

    author Hao, J. , author Rodriguez-Monguio, R. , & author Seoane-Vazquez, E. ( year 2015 ). title Fixed-dose combination drug approvals, patents and market exclusivities compared to single active ingredient pharmaceuticals . journal PLOS ONE \/ , volume 10 \/ , pages e0140708 . :10.1371/journal.pone.0140708

    work page doi:10.1371/journal.pone.0140708 2015

  51. [58]

    , & author Briskorn, D

    author Hartmann, S. , & author Briskorn, D. ( year 2022 ). title An updated survey of variants and extensions of the resource-constrained project scheduling problem . journal European Journal of Operational Research \/ , volume 297 \/ , pages 1--14 . :10.1016/j.ejor.2021.05.004

    work page doi:10.1016/j.ejor.2021.05.004 2022

  52. [59]

    Families of symmetries and the hydrogen atom

    author Heinz, V. , author Nov \'a k, A. , author Vlk, M. , & author Hanz \'a lek, Z. ( year 2022 ). title Constraint programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers . journal Computers & Industrial Engineering \/ , volume 172 \/ , pages 108586 . :10.1016/j.cie.2022.108586

    work page doi:10.1016/j.cie.2022.108586 2022

  53. [60]

    , author Papadimitriou, C

    author Itai, A. , author Papadimitriou, C. H. , & author Szwarcfiter, J. L. ( year 1982 ). title Hamilton paths in grid graphs . journal SIAM Journal on Computing \/ , volume 11 \/ , pages 676--686 . :10.1137/0211056

    work page doi:10.1137/0211056 1982

  54. [61]

    , author Housin, A

    author Janning, K. , author Housin, A. , author Schulte, C. , author Erkens, F. , author Frenken, L. , author Herbst, L. , author Nie ing, B. , & author Schmitt, R. ( year 2025 ). title Conflict-based model predictive control for multi-agent path finding-experimentally validated on a magnetic planar drive system . journal Frontiers in Control Engineering ...

    work page doi:10.3389/fcteg.2025.1645918 2025

  55. [62]

    ( year 2003 )

    author Laborie, P. ( year 2003 ). title Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results . journal Artificial Intelligence \/ , volume 143 \/ , pages 151--188 . :10.1016/S0004-3702(02)00362-4

    work page doi:10.1016/s0004-3702(02)00362-4 2003

  56. [63]

    Adaptive Information Systems and Modelling in Economics and Management Science

    author Leisch, F. , author Weingessel, A. , & author Hornik, K. ( year 1998 ). title On the generation of correlated artificial binary data . journal Working Papers SFB " Adaptive Information Systems and Modelling in Economics and Management Science " \/ , . :10.57938/6884f809-93bc-4497-ab2b-fc1611198f5b

    work page doi:10.57938/6884f809-93bc-4497-ab2b-fc1611198f5b 1998

  57. [64]

    , & author Vanhoucke, M

    author Maenhout, B. , & author Vanhoucke, M. ( year 2013 ). title An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems . journal Omega \/ , volume 41 \/ , pages 485--499 . :10.1016/j.omega.2012.01.002

    work page doi:10.1016/j.omega.2012.01.002 2013

  58. [65]

    title National Health and Nutrition Examination Survey (NHANES) 2009--2010 Data Documentation, Codebook, and Frequencies: Prescription Medications (RXQ\_RX\_F)

    author National Center for Health Statistics ( year 2012 ). title National Health and Nutrition Examination Survey (NHANES) 2009--2010 Data Documentation, Codebook, and Frequencies: Prescription Medications (RXQ\_RX\_F) . howpublished Centers for Disease Control and Prevention (CDC) . https://wwwn.cdc.gov/nchs/nhanes/2009-2010/RXQ_RX_F.htm note accessed: ...

    work page 2012

  59. [66]

    , & author Ternerot, J

    author Nilsson, H. , & author Ternerot, J. ( year 2022 ). title Path planning algorithm for levitating planar motion system \/ . Master's thesis Lund University

    work page 2022

  60. [67]

    author Noon, C. E. , & author Bean, J. C. ( year 1993 ). title An efficient transformation of the generalized traveling salesman problem . journal INFOR: Information Systems and Operational Research \/ , volume 31 \/ , pages 39--44 . :10.1080/03155986.1993.11732212

    work page doi:10.1080/03155986.1993.11732212 1993

  61. [68]

    author Quinn, K. J. , & author Shah, N. H. ( year 2017 ). title A dataset quantifying polypharmacy in the united states . journal Scientific Data \/ , volume 4 \/ , pages 170167 . :10.1038/sdata.2017.167

    work page doi:10.1038/sdata.2017.167 2017

  62. [69]

    ( year 2025 )

    author Rehme, L. ( year 2025 ). title Path-Planning Algorithms for a Levitating Planar Motion System \/ . Master's thesis Lund University

    work page 2025

  63. [70]

    , author Stepanek, F

    author Sonntag, E. , author Stepanek, F. , author Vrba, J. , author Mutylo, E. , & author Slezakova, S. ( year 2023 ). title Method of manufacturing multiple dosage forms with personalised composition and device for carrying out this method . howpublished International Patent Application WO 2023/151732 A1

    work page 2023

  64. [71]

    ( year 2019 )

    author Stern, R. ( year 2019 ). title Multi-agent path finding -- an overview . In editor G. S. Osipov , editor A. I. Panov , & editor K. S. Yakovlev (Eds.), booktitle Artificial Intelligence: 5th RAAI Summer School, Dolgoprudny, Russia, July 4--7, 2019, Tutorial Lectures \/ (pp. pages 96--115 ). address Cham : publisher Springer International Publishing ...

    work page doi:10.1007/978-3-030-33274-7_6 2019

  65. [72]

    author Sutherland, J. J. , author Daly, T. M. , author Liu, X. , author Goldstein, K. , author Johnston, J. A. , & author Ryan, T. P. ( year 2015 ). title Co-prescription trends in a large cohort of subjects predict substantial drug-drug interactions . journal PLOS ONE \/ , volume 10 \/ . :10.1371/journal.pone.0118991

    work page doi:10.1371/journal.pone.0118991 2015

  66. [73]

    , & author Vervaet, C

    author Vanhoorne, V. , & author Vervaet, C. ( year 2020 ). title Recent progress in continuous manufacturing of oral solid dosage forms . journal International Journal of Pharmaceutics \/ , volume 579 \/ , pages 119194 . :10.1016/j.ijpharm.2020.119194

    work page doi:10.1016/j.ijpharm.2020.119194 2020

  67. [74]

    , author Ma, H.-S

    author Wang, Y. , author Ma, H.-S. , author Yang, J.-H. , & author Wang, K.-S. ( year 2017 ). title Industry 4.0: a way from mass customization to mass personalization production . journal Advances in Manufacturing \/ , volume 5 \/ . :10.1007/s40436-017-0204-7

    work page doi:10.1007/s40436-017-0204-7 2017

  68. [75]

    author Wastesson, J. W. , author Morin, L. , author Tan, E. C. K. , & author Johnell, K. ( year 2018 ). title An update on the clinical consequences of polypharmacy in older adults: a narrative review . journal Expert Opinion on Drug Safety \/ , volume 17 \/ , pages 1185--1196 . :10.1080/14740338.2018.1546841

    work page doi:10.1080/14740338.2018.1546841 2018

  69. [76]

    , & author Jayswal, S

    author Yadav, A. , & author Jayswal, S. ( year 2018 ). title Modelling of flexible manufacturing system: a review . journal International Journal of Production Research \/ , volume 56 \/ , pages 2464--2487 . :10.1080/00207543.2017.1387302. arXiv:https://doi.org/10.1080/00207543.2017.1387302 http://arxiv.org/abs/https://doi.org/10.1080/00207543.2017.1387302

    work page doi:10.1080/00207543.2017.1387302 2018

  70. [77]

    , author Andreychuk, A

    author Zahradka, D. , author Andreychuk, A. , author Kulich, M. , & author Yakovlev, K. ( year 2022 ). title Quality analysis of multi-agent multi-item pickup and delivery solutions using a decoupled approach . journal IFAC-PapersOnLine \/ , volume 55 \/ , pages 61--66 . :10.1016/j.ifacol.2023.01.134

    work page doi:10.1016/j.ifacol.2023.01.134 2022