This page shows all publications that appeared in the IASI annual research reports.
Authors currently affiliated with the Institute are always listed with the full name.
You can browse through them using either the links of the following line or those associated with
author names.
Show all publications of the year
ALL, with author Dell'Olmo P., in the category Journal Articles
(or show them all): (Items found: 33)
2006 | 2005 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1995 | 1994 | 1993 | 1992
2006 [top]
2005 [top]
- Confessore G., Dell'Olmo P., Gentili M.: Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem, Computers & Operations Research 32 (9), 2383-2405, 2005
- Dell'Olmo P., Gentili M., Scozzari A.: On finding dissimilar Pareto-optimal paths, European Journal of Operational Research 162 (1), 70-82, 2005
- Dell'Olmo P., Hansen P., Pallottino S., Storchi G.: On uniform $k$-partition problems, Discrete Applied Mathematics 150 (1-3), 121-139, 2005
2003 [top]
- Caramia M., Dell'Olmo P.: Assessing the Resource Usage in Scheduling with Incompatibilities, Or Spectrum 25 (4), 521-547, 2003
2002 [top]
- Blazewicz J., Dell'Olmo P., Drozdowski M.: Scheduling multiprocessor tasks on two parallel processors, Rairo-Recherche Operationnelle-Operations Research, 37-57, 2002
- Caramia M., Dell'Olmo P.: Constraint Propagation in Graph Coloring, Journal of Heuristics 8, 83-107, 2002
- Confessore G., Dell'Olmo P., Giordani S.: An Approximation Result for the Interval Coloring Problem on Claw-free Chordal Graphs, Discrete Applied Mathematics, 73-90, 2002
2001 [top]
- Caramia M., Dell'Olmo P.: Iterative Coloring Extension of a Maximum Clique, Naval Research Logistics 48, 1-33, 2001
- Caramia M., Dell'Olmo P.: A Lower Bound on the Chromatic Number of Mycielski Graphs, Discrete Mathematics 235, 79-86, 2001
- Confessore G., Dell'Olmo P., Giordani S.: An Approximation Result for a Periodic Allocation Problem, Discrete Applied Mathematics 112, 53-72, 2001
2000 [top]
- Confessore G., Dell'Olmo P., Giordani S.: A Linear Time Approximation Algorithm for Interval Coloring on Proper Interval Graphs, International Journal of Mathematical Algorithms 2, 133-147, 2000
- Drozdowski M., Dell'Olmo P.: Scheduling Multiprocessor Tasks for Mean Flow Time Criterion, Computers & Operations Research 27, 571-585, 2000
1999 [top]
- Bianco L., Dell'Olmo P., Giordani S.: Minimizing Total Completion Time Subject to Release Dates and Sequence-Dependent Processing Times, Annals of Operations Research 86, 393-415, 1999
- Bianco L., Dell'Olmo P., Giordani S.: Flow Shop No-Wait Scheduling with Sequence Dependent Setup Times and Release Dates, Information Systems and Operational Research 37, 3-19, 1999
- Bianco L., Dell'Olmo P., Giordani S., Speranza M.G.: Minimizing Makespan in a Multimode Multiprocessor Shop Scheduling Problem, Naval Research Logistics 46, 893-911, 1999
- Blazewicz J., Dell'Olmo P., Drozdowski M.: Scheduling of Client-Server Applications, International Transactions in Operational Research 6, 345-363, 1999
- Dell'Olmo P., Speranza M.G.: Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size, Discrete Applied Mathematics 34, 181-191, 1999
1998 [top]
- Bianco L., Dell'Olmo P., Speranza M.G.: Heuristics for Multimode Scheduling Problems with Dedicated Resources, European Journal of Operational Research 107, 260-271, 1998
- Dell'Olmo P., Kellerer H., Speranza M.G., Tuza Zs.: Partitioning Items in a Fixed Number of Bins to Minimize Total Size, Information Processing Letters 65, 229-233, 1998
- Dror M., Kubiak W., Dell'Olmo P.: Strong-Weak Chain Constrained Scheduling, Ricerca Operativa 27, 36-49, 1998
1997 [top]
- Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M.: Preemptive Multiprocessor Tasks Scheduling with Release Times and Time Windows, Annals of Operations Research 70, 43-55, 1997
- Bianco L., Dell'Olmo P., Giordani S.: An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets, Computational Optimization and Applications 8, 197-210, 1997
- Dell'Olmo P., Giordani S., Speranza M.G.: An approximation result for a duo-processor task scheduling problem, Information Processing Letters 61, 195-200, 1997
- Dror M., Kubiak W., Dell'Olmo P.: Scheduling Chains to Minimize Mean Flow Time, Information Processing Letters 61, 297-301, 1997
1995 [top]
- Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M.: Scheduling multiprocessor tasks on dynamic configuration of dedicated processors, Annals of Operations Research 58, 493-518, 1995
- Bianco L., Dell'Olmo P., Speranza M.G.: Scheduling independent tasks with multiple modes, Discrete Applied Mathematics 62, 35-50, 1995
1994 [top]
- Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M.: Scheduling preemptive multiprocessor tasks on dedicated processors, Performance Evaluation 20, 361-371, 1994
- Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M.: Scheduling UET multiprocessor tasks, Foundation of Computing and Decision Sciences 19, 273-283, 1994
- Bianco L., Dell'Olmo P., Speranza M.G.: Nonpreemptive scheduling of independent tasks with prespecified processors allocation, Naval Research Logistics Quarterly 41, 1994
1993 [top]
- Bianco L., Blazewicz J., Dell'Olmo P., Drozdowski M.: Preemptive scheduling of multiprocessor tasks on dedicated processors systems subject to minimal lateness, Information Processing Letters 46, 109-113, 1993
- Bielli M., Dell'Olmo P.: The flexibility of scheduling tools for order production problems, Computer Integrated Manufacturing Systems 6 (1), 64-70, 1993
1992 [top] |
