Claudio Arbib

Full Professor

Blocco Zero, Room 219


Born in Rome, 1958.

Present position: full professor of Operations Research since November 2000.

 1992: Associate professor of Operations Research at the University of L'Aquila

1987: PhD. in Computer and System Science from the University of Rome " Sapienza". Research assistant of Operations Research at the University of Rome “Tor Vergata”

1984: Research grant within an ESPRIT project on artificial intelligence

1983: Postgraduate degree in Automated Control and Computer Systems from the University of Rome "La Sapienza", best dissertation award

1982: Laurea degree with honors in Electronic Engineering from the University of Rome "La Sapienza"


From 2002 to 2008, in the board of the AIRO – Optimization and Decision Science (Italian Operational Research Society).

From 1990 to 2008, in the Editorial Board of the International Journal of Flexible Manufacturing Systems.

From 2005 to 2010, one of the 10 members elected in the Scientific Committee of the CIRO – Centro Interuniversitario per la Ricerca Operativa (national Inter-university Center for Operational Research).

From 1993 to 2002, in the Editorial Board of the Journal of the Italian Operational Research Society.


From November 2014, athenaeum delegate for research at the University of L’Aquila.

In 2013, visiting professor at Bilkent University, Department of Industrial Engineering (Ankara, Turkey).

From December 2008, chair of the Department of Computer Science (Dipartimento di Informatica) at the University of L’Aquila.

From 2004 to November 2008, chair of the Laurea Degree in Computer Science (Consiglio di Corso di Laurea in Informatica) at the Faculty of Science, University of L’Aquila.

Team leader of national/international research projects by Italian National Research Council (CNR) and Italian Ministry of Education and University (MIUR) on telecommunications, transportation, integrated logistics and combinatorial algorithms. Principal investigator of the 2015 National Research Project 20153TXRX9 (ERC Sector PE1) “Scheduling cuts: new optimization models and algorithms for cutting, packing and nesting in manufacturing processes”.

Responsible of a research unit in an EC Cooperative Research Project on Cutting and Packing within the 6th Framework Programme.

Responsible of research units in EC Projects on Information and Communication Technologies within the 5th Framework Programme.

Participation as invited speaker and/or in the organizing/scientific committee of national and international conferences; in the program committee of AIRO 2017 (Sorrento, Italy), program Chair of AIRO 2002 (L’Aquila, Italy, September 2002), AIRO Winter 2005 (Cortina d’Ampezzo, Italy, January 2005), AIRO Winter 2007 (Cortina d’Ampezzo, Italy, February 2007), 5th ESICUP Meeting (L’Aquila, Italy, April 2008) ), AIRO Winter 2009 (Cortina d’Ampezzo, Italy, January 2009).

Referee of international journals, among others: Annals of Operations Research, Computers and Operations Research, Discrete Applied Mathematics, Discrete Mathematics, European J. of Operational Research, IEEE Trans. on Robotics and Automation, Information Processing Letters, Int. J. of Computer-Aided Engineering and Software, Int. J. of Flexible Manufacturing Systems, Int. J. of Production Research, J. of Scheduling, Networks, Transportation Science.

With the Operations Research team of the University of L’Aquila ranked second for visibility and fourth for yield (resp. first and second in Europe) in the worldwide section of the Eighth Rothkopf Ranking of Universities’ Contributions to the INFORMS Practice Literature[1].

In the Scientific Advisory Board of Fondazione Università dell’Aquila and of the CapiTANK Consortium (Innovation Pole in Chemical-Pharma Technologies, POR FESR ABRUZZO 2007 – 2013,

[1]      Ronald D. Fricker Jr., Interfaces, Vol. 39, No. 6.

Selected publications

  1. C. Arbib, G. Felici, M. Servilio, “Scheduling common operations with general processing times: a branch-and-cut algorithm to minimize the weighted number of tardy jobs”, Omega Int. J. of Management Science
  2. C. Arbib, O.E. Karasan, M.Ç. Pınar, “On envy-free perfect matching”, Discrete Applied Mathematics 
  3. C. Arbib, F. Marinelli, “Maximum lateness minimization in one-dimensional bin packing”, Omega Int. J. of Management Science 68 (2017) 76-84
  4. C. Arbib, M. Servilio, P. Ventura, An improved integer linear programming formulation for the closest 0-1 string problem”, Computers & Operations Research 80 (2017) 94-100
  5. C. Arbib, F. Marinelli, P. Ventura, “One-dimensional cutting stock with a limited number of open stacks: Bounds and Solutions from a New Integer Linear Programming Model”, Int. Trans. on Operational Research 23, 1-2 (2016) 47-63
  6. C. Arbib, G. Felici, M. Servilio, “Sorting common operations to minimize the number of tardy jobs”, Networks 64, 4 (2014) 306-320
  7. C. Arbib, F. Marinelli, “On cutting stock with due dates”, Omega Int. J. of Management Science 46 (2014) 11-20
  8. C. Arbib, C. Archetti, M. Servilio, M.G. Speranza, “The directed profitable location rural postman problem”, European J. of Operational Research 236, 3 (2014) 811-819
  9. C. Arbib, F. Marinelli, F. Pezzella, “An LP-based tabu search for batch scheduling in a cutting process with finite buffers”, Int. J. of Production Economics 136, 2 (2012) 287-296
  10. C. Arbib, M. Labbé, M. Servilio, “Scheduling two chains of unit jobs on one machine: a polyhedral study”, Networks 58, 2 (2011) 103-113
  11. A. Aloisio, C. Arbib, F. Marinelli, “Cutting stock with no three parts per pattern: work-in-process and pattern minimization”, Discrete Optimization (2010) 315-332
  12. A. Aloisio, C. Arbib, F. Marinelli, “On LP relaxations for the pattern minimization problem”, Networks 57, 3 (2009) 247-253
  13. C. Arbib, F. Marinelli, “Exact and asymptotically exact solutions for a class of
    assortment problems”, INFORMS J. on Computing 21, 1 (2009) 13-25
  14. C. Arbib, F. Marinelli, “An optimization model for trim loss minimization in an automotive glass plant”, European J. of Operational Research 183, 3 (2007) 1421-1432
  15. C. Arbib, F. Marinelli, “Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application”, European J. of Operational Research 163, 3(2005) 617-630
  16. C. Arbib, M. Servilio, S. Smriglio, “A competitive scheduling problem and its relevance in UMTS channel assignment”, Networks 44, 2 (2004) 132-141
  17. C. Arbib, F. Marinelli, "The lazy cook problem, or scheduling two parallel machines to minimize vehicle utilization", Int. J. of Flexible Manufacturing Systems 15, 4 (2003) 333-354
  18. C. Arbib, F. Di Iorio, F. Marinelli, F. Rossi, "Cutting and reuse: an application from automotive component manufacturing", Operations Research 50, 6 (2002) 923-934.
  19. C. Arbib, A. Caprara, "On the stability number of the edge intersection of two graphs", Information Processing Letters 83 (2002) 173-174
  20. C. Arbib, R. Mosca, "On (P5, diamond)-free graphs", Discrete Mathematics 250 (2002) 1-22
  21. C. Arbib, M. Flammini, "On the upper chromatic number of (v3,b2)-configurations", Discrete Applied Mathematics 120 (2002) 3-12
  22. C. Arbib, C., A. Da Soghe, G. Iuliano, "Optimizing multi-chamber work cell management: an application to an AMOS wafer fab", IEEE Trans. on Semiconductor Manufacturing 14, 3 (2001) 1-8
  23.   C. Arbib, F. Rossi, "Optimal resource assignment through negotiation in a multi-agent manufacturing system", IIE Transactions 32 (2000) 963-974
  24. C. Arbib, F. Rossi, "An optimization problem arising in the design of multiring systems", European J. of Operational Research 124, 1 (2000) 63-76
  25. C. Arbib, M. Flammini, E. Nardelli, "How to survive while visiting a graph",Discrete Applied Mathematics 99 (2000) 279-293
  26. C. Arbib, R. Mosca, "Polynomial algorithms for special cases of the balanced bipartite subgraph problem", J. of Combinatorial Mathematics and Combinatorial Computing 30 (1999) 3-22
  27. C. Arbib, D. Pacciarelli, S. Smriglio, "A three dimensional matching model for perishable production scheduling", Discrete Applied Mathematics 92 (1999) 1-15
  28. Agnetis, A., C. Arbib, "Concurrent operations assignment and sequencing for particular assembly problems in flow lines", Annals of Operations Research 69 (1997) 1-31
  29. Agnetis, A., C. Arbib, M. Lucertini, F. Nicolò, "Task assignment and sub-assembly scheduling in flexible assembly lines", IEEE Transactions on Robotics and Automation 11, 1 (1995), 1-20
  30. Arbib, C., M. Lucertini, F. Nicolò, "Workload balancing and part transfer minimization in flexible manufacturing systems", International Journal of Flexible Manufacturing Systems 3, 1 (1991) 5-25
  31. Arbib, C., M. Lucertini, F. Nicolò, "Optimization models for flexible manufacturing systems", Wissenshaftliche Zeitschrift 12, 2 (1988) 67-73
  32. Arbib, C., G.F. Italiano, A. Panconesi, "Predicting deadlock in store-and-forward networks", Networks 20 (1990) 861-881.
  33. Agnetis, A.,  C. Arbib, M. Lucertini, F. Nicolò, "Part routing in flexible assembly systems", IEEE Transactions on Robotics and Automation 6, 6 (1990) 697-705
  34. Arbib, C., "A polynomial characterization of some graph partitioning problems",Information Processing Letters 26 (1987/88) 223-230
  35. C. Arbib, M.Ç. Pınar, M. Tonelli, "Competitive location and pricing on a line with metric transportation costs", European J. of Operational Research, to appear (2018)
  36. C. Arbib, F. Marinelli, “Scheduling and control of material handling in a flexible manufacturing cell”, Ricerca Operativa 31, 101-102 (2002) 73-94
  37. C. Arbib, G. Ciaschetti, A. Petrucci, “Mold and job scheduling in plastic printing: a column generation approach”, Ricerca Operativa 31, 101-102 (2002) 53-72
  38. C. Arbib, "A bound on the stability number of graphs with boxicity k(an exercise)",Ricerca Operativa29, 90 (1999) 55-61
  39. C. Arbib, F. Marinelli, P. Ventura, “Cutting stock with bounded open stacks: a new integer programming model”, University of L’Aquila, Technical Report TRCS 007/2010, and Optimization Online,
  40. C. Arbib, F. Marinelli, “A p-median model for assortment and trim loss minimization with an application to the glass industry”,Optimization Online,
  41. C. Arbib, G. Felici (eds.), Recent OR contributions in network problems, feature issue of the European J. of Operational Research 189, 3 (2008)
  42. C. Arbib, F. Rossi, S. Smriglio (eds.), Combinatorial optimization and applications, special volume of Annals of Operations Researchin honour of Mario Lucertini, 150, 1 (2007)
  43. C. Arbib, P. Davidsson, M.T. Moghaddam, H. Muccini, An IoT Software Architecture for an Evacuable Building Architecture, Proceedings of HICSS 2018 - The Hawaii Int. Conf. on System Sciences, Honululu, US (2018)
  44. M. Tonelli, C. Arbib, “On metric location and pricing problems”, 7th Int. Conference on Information Systems, Logistics and Supply Chain, Lyon, France (July 8–11, 2018):
  45. C. Arbib, F. Marinelli, A. Pizzuti, R. Rosetti, A heuristic for a rich and real two-dimensional woodboard cuttig problem, 7th Int. Conference on Operations Research and Enterprise System, ICORES 2018 (Funchal, Madeira – Portugal, January 24-26 2018):, Best student paper award
  46. C. Arbib, P. Avella, M. Boccia, F. Marinelli, S. Mattia, “Optimization models for cut sequencing”, in: A. Sforza and C. Sterle (eds.), Optimization and Decision Science: Methodologies and Applications,DOI 10.1007/978-3-319-67308-0_45 (2017)
  47. C. Arbib, M.Ç. Pınar, M. Tonelli, A bilevel uncapacitated location/pricing problem with Hotelling access costs in one-dimensional space, 6th Int. Conference on Information Systems, Logistics and Supply Chain, Bordeaux, France (June 1–4, 2016):
  48. C. Arbib, G. Felici, M. Servilio, “Sorting common operations to minimize tardy jobs”, ECCO XXV, Antalya, Turkey (April 26-28, 2012)
  49. C. Arbib, F. Marinelli, C.M. Scoppola, "A lower bound for the cutting stock problem with a limited number of open stacks", 8th Cologne-Twente Workshop on Graph and Combinatorial Optimization, Paris, France (June  2-4, 2009)
  50. A. Aloisio, C. Arbib, F. Marinelli, “On the pattern minimization problem”, Graph and Optimization Meeting 2008, Saint-Maximin La Sainte Baume, France (August 2008)
  51. C. Arbib, M. Flammini, F. Marinelli, “Minimum flow time graph ordering”, Proc. of the WG’02: Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Sciencen. 2880, Springer-Verlag (2003) 23-33
  52. C. Arbib, G. Bogo, C. Campa, S. Chini, F. Del Sorbo, L. Dimopoulou, G. Lombardi, S-H. Oh, J.M. Sanchez, M. Servilio: “QoS provision and IP multimedia services in FUTURE - physical demonstrator architecture for experiments”, IST Mobile & Wireless Telecommunications Summit 03, Aveiro, Portugal (June 2003)
  53. M. Albani, C. Arbib, F. Del Sorbo, A. Giralda, G. Leoleis, G. Lombardi, S-H. Oh, J.M. Sanchez, M. Servilio: “Framework of resource management for S-UMTS”,IST Mobile & Wireless Telecommunications Summit 03, Aveiro, Portugal, (June 2003)
  54. M. Albani, C. Arbib, V. Arvia, F. Del Sorbo, A. Giralda, C.F. Grecas, G. Lombardi, S-H.Oh, J.M. Sanchez, D.C. Schultz, M. Servilio, “A QoS concept for packet oriented S-UMTS services”,IST Mobile & Wireless Telecommunications Summit 2002, Thessaloniki, GR (June 2002)
  55. C. Arbib, F. Rinaldi, "The subpartition problem", ECCO XIII Conference, Capri, I (May 2000)
  56. C. Arbib, G. Ciaschetti, F. Rossi, "Distributing material flows in a manufacturing system with large product mix: two models based on column generation", in: M.G. Speranza, P. Stähly (eds.), New Trends in Distribution LogisticsLecture Notes in Economics and Mathematical Systems, n. 484, Springer-Verlag (1999) 235-249
  57. C. Arbib, "A primal-dual property of the upper chromatic number of mixed hypergraphs", 6thTwente Workshop on Graphs and Combinatorial Optimization, Enschede, NL (May 26-28, 1999).
  58. Agnetis, A., C. Arbib, M. Lucertini, "The combinatorial approach to flow management in FMS", in P. Brandimarte, A. Villa (eds.): Optimization Models and Concepts in Production Management, Gordon and Breach Science Publishers, Basel (1995)
  59. Agnetis, A., C. Arbib, M. Lucertini, "Combinatorial models for manufacturing: optimizing flow management in flexible production systems", in T.A. Ciriani, R.C. Leachman (eds.): Optimization in Industry, J. Wiley & Sons (1993)
  60. Arbib, C., U. Mocci, C. Scoglio, "Methodological aspects of ring network design", in P. Kall (ed.): System Modelling and Optimization: Proc. of the 15th IFIP Conference, Lecture Notes in Control and Information Sciences, 180, Springer-Verlag (1992)
  61. Agnetis, A., C. Arbib, M. Lucertini, F. Nicolò, "Task assignment in pipeline assembly systems", Proc. of the 1992 IEEE Conference on Robotics and Automation, Nice, France (1993)
  62. Arbib, C., “Tool loading problems in FMS and VLSI circuit layout problems”, System Modelling and Optimization, Springer-Verlag (1992) 865-874
  63. Arbib, C., U. Mocci, C. Scoglio, "Optimal multiplexing of packetized traffics with different requirements”,Proc. of the SET/IEEE International Telecommunication Symposium, Rio de Janeiro, Brasil (1991)
  64. Arbib, C., "Two polynomial problems in PLA folding", in R.H. Moehring (ed.): Proc. of the 16th International Workshop on Graph Theoretic Concepts, Lecture Notes in Computer Science, n. 484, Springer-Verlag (1990) 119-129
  65. Agnetis, A., C. Arbib, K.E. Stecke, "Optimal two-machine scheduling in a flexible flow system", Proc. of the 2nd International Conference on CIM, Troy, NY, May 1990, IEEE Computer Society Press, 47-54
  66. Arbib, C., L. Perugini, "Optimal part routing in FMS", in M. Pridham e C. O'Brien (eds.): Production Research: Approaching the 21st Century, Taylor & Francis (1989) 544-550
  67. Arbib, C., M. Lucertini, F. Nicolò, "Optimization models for flexible manufacturing systems", Operations research models in flexible manufacturing systems, Springer-Verlag New York (1989) 75-89
  68. Arbib, C., G. Cioni, "Meta-reasoning and data structuring for improving PROLOG programming style", in Ph. Jorrand e V. Sgurev (eds.): Artificial Intelligence II: Methodology, Systems, Applications, Elsevier Science Publ. B.V. (1987) 55-61
  69. Arbib, C., "A polynomial algorithm for partitioning line-graphs”, in B. Simeone (ed.): Lecture Notes in Mathematics, Springer-Verlag (Berlin 1986) 198-208