Paolo Detti
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
Paolo Detti has a total of 60 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Agnetis
Università degli Studi di Siena
13 shared publications - Carlo Meloni
Politecnico di Bari
11 shared publications - Marco Pranzo
Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche, Università di Siena, Siena, Italy
9 shared publications - Marco Moretti
University of Pisa
6 shared publications - Garazi Zabalo Manrique de Lara
Dipartimento di Ingegneria dell'Informazione e Scienze Matematiche University of Siena Via Roma 56 Siena Italy
5 shared publications Andrea Abrardo
4 shared publications
Latest Publications
- Open Access
- 30 September 2026
- Published by Elsevier in SSRN Electronic Journal
Mixed Batch Scheduling with Stochastic Processing Times
This paper studies a stochastic mixed batch scheduling problem motivated by vacuum heat treatment. The processing time of a batch is a weighted combination of the maximum and total processing times of its jobs, whose processing times are random. The objective is to minimize the expected makespan. For the single machine problem, we establish structural properties of optimal schedules under stochastic ordering and prove the optimality of the full-batch longest expected processing time (FBLEPT) algorithm. For identical parallel machines with independent, stochastically ordered processing times, we develop a hybrid algorithm that selects between FBLEPT and singleton longest expected processing time scheduling (SLEPT). We derive a worst-case approximation ratio for the expected makespan without requiring a specific distributional form. We then study the special case of two machines with batch capacity two and independent and identically distributed exponential processing times. Within the class of non-preemptive static batching-list policies, we show that an optimal list places two-job batches before singleton batches. We derive closed-form expressions for the expected makespan and use them to determine the optimal number of two-job batches. We also characterize the thresholds at which the optimal batch composition changes as the mixing parameter varies, including ties at the threshold values.
- 30 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessMixed Batch Scheduling with Stochastic Processing Times
This paper studies a stochastic mixed batch scheduling problem motivated by vacuum heat treatment. The processing time of a batch is a weighted combination of the maximum and total processing times of its jobs, whose processing times are random. The objective is to minimize the expected makespan. For the single machine problem, we establish structural properties of optimal schedules under stochastic ordering and prove the optimality of the full-batch longest expected processing time (FBLEPT) algorithm. For identical parallel machines with independent, stochastically ordered processing times, we develop a hybrid algorithm that selects between FBLEPT and singleton longest expected processing time scheduling (SLEPT). We derive a worst-case approximation ratio for the expected makespan without requiring a specific distributional form. We then study the special case of two machines with batch capacity two and independent and identically distributed exponential processing times. Within the class of non-preemptive static batching-list policies, we show that an optimal list places two-job batches before singleton batches. We derive closed-form expressions for the expected makespan and use them to determine the optimal number of two-job batches. We also characterize the thresholds at which the optimal batch composition changes as the mixing parameter varies, including ties at the threshold values.
- 22 September 2026
- Published by Wiley in Naval Research Logistics (NRL)
Batch Scheduling on Parallel Machines With Submodular Costs
This paper is motivated by the characteristics in the quenching and tempering process of steel workpieces, where the batch processing time is increasing and exhibits diminishing marginal returns. We model the batch processing time using submodular functions and study batch scheduling problems on identical parallel machines with bounded machine capacity. When the batch processing time is characterized by a submodular function, we provide a counterexample for the single‐machine problem, showing that the full batch strategy is not always optimal. We then focus on the parallel‐machine problem, where we establish the worst‐case performance ratio of the full‐batch longest processing time (FBLPT) algorithm and present a corresponding tight instance. When the batch processing time is characterized by a value‐monotone submodular function, we establish the worst‐case performance ratio of Algorithm FBLPT and provide a tight instance, and further design a modified version of this algorithm and analyze its performance. Finally, when the batch processing time is characterized by a nondecreasing concave function of the total processing time of the jobs in a batch, we design the longest processing time first‐full batch‐batch moving algorithm. We then analyze its worst‐case performance ratios for both unbounded and bounded machine capacity cases, where the result for the unbounded case serves as a theoretical foundation for the analysis of the bounded case. The effectiveness of the proposed algorithms is verified through computational experiments.
- 22 September 2026
- Published by Wiley in Naval Research Logistics (NRL)
Batch Scheduling on Parallel Machines With Submodular Costs
This paper is motivated by the characteristics in the quenching and tempering process of steel workpieces, where the batch processing time is increasing and exhibits diminishing marginal returns. We model the batch processing time using submodular functions and study batch scheduling problems on identical parallel machines with bounded machine capacity. When the batch processing time is characterized by a submodular function, we provide a counterexample for the single‐machine problem, showing that the full batch strategy is not always optimal. We then focus on the parallel‐machine problem, where we establish the worst‐case performance ratio of the full‐batch longest processing time (FBLPT) algorithm and present a corresponding tight instance. When the batch processing time is characterized by a value‐monotone submodular function, we establish the worst‐case performance ratio of Algorithm FBLPT and provide a tight instance, and further design a modified version of this algorithm and analyze its performance. Finally, when the batch processing time is characterized by a nondecreasing concave function of the total processing time of the jobs in a batch, we design the longest processing time first‐full batch‐batch moving algorithm. We then analyze its worst‐case performance ratios for both unbounded and bounded machine capacity cases, where the result for the unbounded case serves as a theoretical foundation for the analysis of the bounded case. The effectiveness of the proposed algorithms is verified through computational experiments.
- Open Access
- 21 June 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 159
Solving crop planning and rotation problems in a sustainable agriculture perspective
- 21 June 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 159
Open AccessSolving crop planning and rotation problems in a sustainable agriculture perspective
- Open Access
A vehicle routing problem for biological sample transportation in healthcare: mathematical formulations and a metaheuristic approach
In this paper, a real-world transportation problem is addressed, concerning the collection and the transportation of biological sample tubes from sampling points to a main hospital. Blood and other biological samples are collected in different centers during morning hours. Then, the samples are transported to the main hospital, for their analysis, by a fleet of vehicles located in geographically distributed depots. Each sample has a limited lifetime and must arrive to the main hospital within that time. If a sample cannot arrive to the hospital within the lifetime, either is discarded or must be processed in dedicated facilities called Spoke Centers.Two Mixed Integer Linear Programming formulations and an Adaptive Large Neighborhood Search (ALNS) metaheuristic algorithm have been developed for the problem. Computational experiments on different sets of instances based on real-life data provided by the Local Healthcare Authority of Bologna, Italy, are presented. A comparison on small instances with the optimal solutions obtained by the formulations shows the effectiveness of the proposed ALNS algorithm. On real-life instances, different batching policies of the samples are evaluated. The results show that the ALNS algorithm is able to find solutions in which all the samples are delivered on time, while in the real case about the 40% [5] of the samples is delivered late.
Open AccessA vehicle routing problem for biological sample transportation in healthcare: mathematical formulations and a metaheuristic approach
In this paper, a real-world transportation problem is addressed, concerning the collection and the transportation of biological sample tubes from sampling points to a main hospital. Blood and other biological samples are collected in different centers during morning hours. Then, the samples are transported to the main hospital, for their analysis, by a fleet of vehicles located in geographically distributed depots. Each sample has a limited lifetime and must arrive to the main hospital within that time. If a sample cannot arrive to the hospital within the lifetime, either is discarded or must be processed in dedicated facilities called Spoke Centers.Two Mixed Integer Linear Programming formulations and an Adaptive Large Neighborhood Search (ALNS) metaheuristic algorithm have been developed for the problem. Computational experiments on different sets of instances based on real-life data provided by the Local Healthcare Authority of Bologna, Italy, are presented. A comparison on small instances with the optimal solutions obtained by the formulations shows the effectiveness of the proposed ALNS algorithm. On real-life instances, different batching policies of the samples are evaluated. The results show that the ALNS algorithm is able to find solutions in which all the samples are delivered on time, while in the real case about the 40% [5] of the samples is delivered late.
- 9 November 2020
- Published by Springer Nature
- p. 293-306
A Metaheuristic Approach for Biological Sample Transportation in Healthcare
- 9 November 2020
- Published by Springer Nature
- p. 293-306
A Metaheuristic Approach for Biological Sample Transportation in Healthcare
- Open Access
A new upper bound for the multiple knapsack problem
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are divisible. Such a relaxation, called sequential relaxation, is obtained by suitably replacing the items of a MKP instance with items with divisible sizes. Experimental results on benchmark instances show that the upper bound is effective when the ratio between the number of items and the number of knapsacks is small.
Open AccessA new upper bound for the multiple knapsack problem
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are divisible. Such a relaxation, called sequential relaxation, is obtained by suitably replacing the items of a MKP instance with items with divisible sizes. Experimental results on benchmark instances show that the upper bound is effective when the ratio between the number of items and the number of knapsacks is small.
- Top Cited PapersOpen Access
EEG Synchronization Analysis for Seizure Prediction: A Study on Data of Noninvasive Recordings
Objective: Epilepsy is a neurological disorder arising from anomalies of the electrical activity in the brain, affecting ~65 million individuals worldwide. Prediction methods, typically based on machine learning methods, require a large amount of data for training, in order to correctly classify seizures with small false alarm rates. Methods: In this work, we present a new database containing EEG scalp signals of 14 epileptic patients acquired at the Unit of Neurology and Neurophysiology of the University of Siena, Italy. Furthermore, a patient-specific seizure prediction method, based on the detection of synchronization patterns in the EEG, is proposed and tested on the data of the database. The use of noninvasive EEG data aims to explore the possibility of developing a noninvasive monitoring/control device for the prediction of seizures. The prediction method employs synchronization measures computed over all channel pairs and a computationally inexpensive threshold-based classification approach. Results and conclusions: The experimental analysis, performed by inspection and by the proposed threshold-based classifier on all the patients of the database, shows that the features extracted by the synchronization measures are able to detect preictal and ictal states and allow the prediction of the seizures few minutes before the seizure onsets.
Top Cited PapersOpen AccessEEG Synchronization Analysis for Seizure Prediction: A Study on Data of Noninvasive Recordings
Objective: Epilepsy is a neurological disorder arising from anomalies of the electrical activity in the brain, affecting ~65 million individuals worldwide. Prediction methods, typically based on machine learning methods, require a large amount of data for training, in order to correctly classify seizures with small false alarm rates. Methods: In this work, we present a new database containing EEG scalp signals of 14 epileptic patients acquired at the Unit of Neurology and Neurophysiology of the University of Siena, Italy. Furthermore, a patient-specific seizure prediction method, based on the detection of synchronization patterns in the EEG, is proposed and tested on the data of the database. The use of noninvasive EEG data aims to explore the possibility of developing a noninvasive monitoring/control device for the prediction of seizures. The prediction method employs synchronization measures computed over all channel pairs and a computationally inexpensive threshold-based classification approach. Results and conclusions: The experimental analysis, performed by inspection and by the proposed threshold-based classifier on all the patients of the database, shows that the features extracted by the synchronization measures are able to detect preictal and ictal states and allow the prediction of the seizures few minutes before the seizure onsets.
- 1 July 2019
- Published by Elsevier in Computers & Operations Research
- Vol. 107, 19-31
Robust single machine scheduling with a flexible maintenance activity
- 1 July 2019
- Published by Elsevier in Computers & Operations Research
- Vol. 107, 19-31
Robust single machine scheduling with a flexible maintenance activity