Mastrolilli Monaldo

Monaldo Mastrolilli

Information about the author Monaldo Mastrolilli will soon be added to the site.
Found 12 papers in total
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
2017
The Lasserre/Sum‐of‐Squares (SoS) hierarchy is a systematic procedure...
On the Approximability of Single‐Machine Scheduling with Precedence Constraints
On the Approximability of Single‐Machine Scheduling with Precedence Constraints
2011
We consider the single‐machine scheduling problem to minimize the weighted sum...
Efficient approximation schemes for scheduling problems with release dates and delivery times
Efficient approximation schemes for scheduling problems with release dates and delivery times
2003
We consider the problem of scheduling n independent jobs on m identical machines that...
Approximation schemes for job shop scheduling problems with controllable processing times
Approximation schemes for job shop scheduling problems with controllable processing times
2005
In this paper we study the job shop scheduling problem under the assumption that the...
An optimization methodology for intermodal terminal management
An optimization methodology for intermodal terminal management
2001
A solution to the problems of resource allocation and scheduling of loading and...
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
2006
This article analyzes the performance of metaheuristics on the vehicle routing problem...
Core instances for testing: A case study
Core instances for testing: A case study
2005
Data generation for computational testing of optimization algorithms is a key topic in...
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
2005
Tabu search algorithms are amongst the most successful local search based methods for...
Scheduling to minimize max flow time: Off-line and on-line algorithms
Scheduling to minimize max flow time: Off-line and on-line algorithms
2004
We investigate the max flow time scheduling problem in the off-line and on-line...
On-line scheduling to minimize maximum flow time: an optimal preemptive algorithm
On-line scheduling to minimize maximum flow time: an optimal preemptive algorithm
2005
We investigate the maximum flow time minimization problem of on-line scheduling jobs...
Approximation schemes for parallel machine scheduling problems with controllable processing times
Approximation schemes for parallel machine scheduling problems with controllable processing times
2004
We consider the problem of scheduling n independent jobs on m identical machines that...
Effective neighbourhood functions for the flexible job shop problem
Effective neighbourhood functions for the flexible job shop problem
2000
The flexible job shop problem is an extension of the classical job shop scheduling...
Papers per page: