PCPierpaolo Caricato

Pierpaolo Caricato

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Pierpaolo Caricato has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Common Experimentation Platform for Engineer-to-Order Production Planning: Optimization Patterns as a Stable Core, Solver and Data Interfaces as Boundary Resources

    by Pierpaolo Caricato, Antonio Grieco

    Production planning in Engineer-to-Order (ETO) companies is a multi-project scheduling problem with long lead times, overlapping engineering and production phases and scarce shared resources. New planning methods are hard to evaluate in this setting: company data are confidential and costly to prepare, so each study builds its own model, data and solver pipeline, and results are rarely comparable. This paper applies platform architecture concepts to this problem and presents a common experimentation platform developed within the publicly funded ETOSS project. A library of optimization patterns and a canonical ETO data schema form the stable core. The solver and data interfaces are boundary resources, against which solvers, learning-based planners and industrial domains are connected as complements; a calibrated instance generator replaces confidential data with shareable synthetic benchmarks. A proof of concept shows that two constraint programming solvers were connected to the same core with changes confined to their bridges, that a second domain was added as a phase template, and that every discrepancy found lay at the interfaces. From these discrepancies the paper derives a first specification of the solver interface, and it closes with a research agenda for the remaining project activities.

  • Open Access

    An End-to-End Optimization Pattern Framework for Engineer-to-Order Production Planning

    by Pierpaolo Caricato

    Engineer-to-Order (ETO) manufacturing environments pose significant planningchallenges due to customized products, long lead times, overlappingengineering and production phases, and competition among multiple projectsfor scarce resources. This paper proposes a comprehensive optimizationpattern framework for ETO production planning that spans the entire modelingpipeline, from raw planning data to a concrete, solver-ready schedule. Fourpattern layers compose the framework: general patterns, applicable to anyoptimization problem; problem-specific patterns for ETO project scheduling(activity, task, job, container, precedence, resource-allocation, and along-lead-time-item procurement pattern); data patterns, formalized through arelational data model that includes a new Data Provenance pattern formanaging template- versus order-derived planning data under uncertainty; andsolver-specific patterns that translate the same problem-level model into achosen constraint solver. The framework's generality is demonstrated alongtwo independent axes. First, it is instantiated and validated across twodistinct industrial domains: a satellite constellation production case, anda real ETO manufacturing case whose aggregate statistics calibrate aparametric synthetic-instance generator, producing a citable, reusable540-instance benchmark family. Second, it is shown to be solver-agnostic,independently instantiated in both IBM CP Optimizer and Google OR-ToolsCP-SAT with no change to the underlying pattern vocabulary, only to thesolver-bridge layer. A large-scale computational study across the generatedbenchmark solves every instance to a feasible schedule, with clear,monotonic scalability and schedule-risk trends driven by resource scarcity,due-date tightness, and procurement-lead-time uncertainty.


  • Open Access

    Exact and Evolutionary Approaches for an Integrated Parallel Machine Tooling Problem with Diameter and Material Setups

    by Alzira Mota, Pierpaolo Caricato, Antonio Grieco, João Bastos, Paulo Ávila

    Efficient management of tool switches is a critical issue in parallel machine environments where setup operations arise from tool loading, diameter adjustments and material changes. While tool loading constraints have been widely studied, the joint consideration of diameter adjustments and material changes has received comparatively limited attention in the scheduling literature. This paper studies an integrated parallel machine tooling problem that incorporates these setup dependencies, reflecting operational conditions observed in manufacturing systems.Two mixed-integer linear programming (MILP) formulations are developed. Model~1 extends formulations from the literature, while Model~2, inspired by the multiple travelling salesman problem, is designed to capture the problem's combinatorial structure better. Both models solve a relaxed formulation that does not explicitly incorporate unloading decisions, and a final schedule is obtained by applying a KTNS-based policy.Computational experiments show that Model~1 is limited to small instances, whereas Model~2 presents better scalability. However, for some medium- and large-sized instances that meet the imposed time limit, the relaxed solution does not always yield a feasible schedule after the KTNS procedure.In addition, three evolutionary metaheuristic approaches are analysed: a permutation-based genetic algorithm (GA), its memetic extension with bounded local search (GA+LS), and a hybrid biased random-key genetic algorithm (BRKGA). Results on synthetic benchmarks show that BRKGA performs best overall, particularly on larger instances.An industrial case study reveals a different pattern: for medium-sized real instances, GA and GA+LS produce solutions comparable to those of the exact model within substantially shorter runtimes.

  • Open Access

    From Key Role to Core Infrastructure: Platforms as AI Enablers in Hospitality Management

    by Antonio Grieco, Pierpaolo Caricato, Paolo Margiotta

    The increasing complexity of managing maintenance activities across geographically dispersed hospitality facilities necessitates advanced digital solutions capable of effectively balancing operational costs and service quality. This study addresses this challenge by designing and validating an intelligent Prescriptive Maintenance module, leveraging advanced Reinforcement Learning (RL) techniques within a Digital Twin (DT) infrastructure, specifically tailored for luxury hospitality networks characterized by high standards and demanding operational constraints. The proposed framework is based on an RL agent trained through Proximal Policy Optimization (PPO), which allows the system to dynamically prescribe preventive and corrective maintenance interventions. By adopting such an AI-driven approach, platforms are the enablers to minimize service disruptions, optimize operational efficiency, and proactively manage resources in dynamic and extended operational contexts. Experimental validation highlights the potential of the developed solution to significantly enhance resource allocation strategies and operational planning compared to traditional preventive approaches, particularly under varying resource availability conditions. By providing a comprehensive and generalizable representation model of maintenance management, this study delivers valuable insights for both researchers and industry practitioners aiming to leverage digital transformation and AI for sustainable and resilient hospitality operations.


  • Open Access

    Beyond Kanban: POLCA-Constrained Scheduling for Job Shops

    by Antonio Grieco, Pierpaolo Caricato, Paolo Margiotta

    This study investigates the integration of finite capacity scheduling with POLCA-based workload control in high-mix, low-volume production environments. We propose a proactive scheduling approach that embeds POLCA constraints into a constraint programming (CP) model, aiming to reconcile the trade-offs between utilization efficiency and system responsiveness. The proposed methodology is evaluated in two phases. First, a simplified job shop simulation compares a traditional reactive POLCA implementation with the CP-based proactive approach under varying system configurations, demonstrating significant reductions in lead times, tardiness, and deadlock occurrences. Second, an industrial case study in an aerospace manufacturing firm validates the practical applicability of the approach by retrospectively comparing the CP model against an existing commercial scheduler. The results underscore that the integrated framework not only enhances scheduling performance through improved workload control but also provides a more stable operational environment.


  • Open Access

    Algorithmic Advances for 1.5-Dimensional Two-Stage Cutting Stock Problem

    by Antonio Grieco, Pierpaolo Caricato, Paolo Margiotta

    The Cutting Stock Problem (CSP) is an optimization challenge that involves dividing large objects into smaller components while considering various managerial objectives. The problem’s complexity can differ based on factors such as object dimensionality, the number of cutting stages required, and any technological constraints. The demand for coils of varying sizes and quantities necessitates intermediate splitting and slitting stages to produce the finished rolls. Additionally, relationships between orders are affected by dimensional variations at each stage of processing. This specific variant of the problem is known as the One-and-a-Half Dimensional Two-Stage Cutting Stock Problem (1.5-D TSCSP). To address the 1.5-D TSCSP, two algorithmic approaches were developed: the Generate-and-Solve (G&S) method and a hybrid Row-and-Column Generation (R&CG) approach. Both aim to minimize total trim loss while navigating the complexities of the problem. Inspired by existing problems in the literature for simpler versions of the problem, a set of randomly generated test cases was prepared, as detailed in this paper. An implementation of the two approaches was used to obtain solutions for the generated test campaign. The simpler G&S approach demonstrated superior performance in solving smaller instances of the problem, while the R&CG approach exhibited greater efficiency and provided superior solutions for larger instances.


  • Open Access

    Algorithmic Advances for 1.5D Two-Stage Cutting Stock Problem

    by Antonio Grieco, Pierpaolo Caricato, Paolo Margiotta

    The 1.5D Two-Stage Cutting Stock Problem is tackled by building upon two established methodologies from the literature: a straightforward Generate & Solve approach and a combined Row & Column Generation approach, both originally developed for the one-dimensional model. To account for the unique challenges posed by the 1.5D nature of the problem, these canonical methods are extended to handle intermediate orders introduced by the two-stage cutting process. The proposed algorithm undergoes rigorous validation through an extensive experimental campaign, which includes benchmarking the performance of the two approaches.

  • Open Access

    Workforce influence on manufacturing machines schedules

    by Pierpaolo Caricato, Antonio Grieco, Anna Arigliano, Luciano Rondone

    This study addresses a parallel machines scheduling problem with sequence-dependent setup times and additional resource constraints related to workforce management. In most industrial cases, the execution of jobs requires the involvement of human resources in addition to machines: this work addresses the many complications due to workforce-specific issues that arise in a real industrial application. This is achieved separating the complex yet classical parallel machines scheduling problem with sequence-dependent setup times from the additional human resources planning problem: the former is formulated and solved through constraint programming, while an ad hoc procedure is provided for the latter. An Italian specialized firm, Prosino S.r.l., provides the industrial case to both validate the adequacy of the adopted method to the actual industrial problem and test the effectiveness of the proposed approach. Computational results obtained over six months of experimentation at the partner firm are presented.