Claudio Arbib

Full Professor

Blocco Zero, Room 219
claudio.arbib@univaq.it
0862433126
International Journals 1. C. Arbib, M. Servilio, P. Ventura, “An improved integer linear programming formulation for the closest 0-1 string problem”, Computers & Operations Research, doi: 10.1016/j.cor.2016.11.019 (available online 19 November 2016) 2. 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 3. C. Arbib, G. Felici, M. Servilio, “Sorting common operations to minimize the number of tardy jobs”, Networks 64, 4 (2014) 306-320 4. C. Arbib, F. Marinelli, “On cutting stock with due dates”, Omega Int. J. of Management Science 46 (2014) 11-20 5. 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, online (2013) with DOI: 10.1016/j.ejor.2013.07.018 6. 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 7. C. Arbib, M. Labbé, M. Servilio, “Scheduling two chains of unit jobs on one machine: a polyhedral study”, Networks 58, 2 (2011) 103-113 8. A. Aloisio, C. Arbib, F. Marinelli, “Cutting stock with no three parts per pattern: work-in-process and pattern minimization”, Discrete Optimization 8 (2010) 315-332 9. A. Aloisio, C. Arbib, F. Marinelli, “On LP relaxations for the pattern minimization problem”, Networks 57, 3 (2009) 247-253 10. C. Arbib, F. Marinelli, “Exact and asymptotically exact solutions for a class of assortment problems”, INFORMS J. on Computing 21, 1 (2009) 13-25 11. 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 12. 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 13. C. Arbib, M. Servilio, S. Smriglio, “A competitive scheduling problem and its relevance in UMTS channel assignment”, Networks 44, 2 (2004) 132-141 14. 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 15. 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. 16. C. Arbib, A. Caprara, "On the stability number of the edge intersection of two graphs", Information Processing Letters 83 (2002) 173-174 17. C. Arbib, R. Mosca, "On (P5, diamond)-free graphs", Discrete Mathematics 250 (2002) 1-22 18. C. Arbib, M. Flammini, "On the upper chromatic number of (v3,b2)-configurations", Discrete Applied Mathematics 120 (2002) 3-12 19. 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 20. C. Arbib, F. Rossi, "Optimal resource assignment through negotiation in a multi-agent manufacturing system", IIE Transactions 32 (2000) 963-974 21. C. Arbib, F. Rossi, "An optimization problem arising in the design of multiring systems", European J. of Operational Research 124, 1 (2000) 63-76 22. C. Arbib, M. Flammini, E. Nardelli, "How to survive while visiting a graph", Discrete Applied Mathematics 99 (2000) 279-293 23. 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 24. C. Arbib, D. Pacciarelli, S. Smriglio, "A three dimensional matching model for perishable production scheduling", Discrete Applied Mathematics 92 (1999) 1-15 25. Agnetis, A., C. Arbib, "Concurrent operations assignment and sequencing for particular assembly problems in flow lines", Annals of Operations Research 69 (1997) 1-31 26. 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 27. 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 28. Arbib, C., M. Lucertini, F. Nicolò, "Optimization models for flexible manufacturing systems", Wissenshaftliche Zeitschrift 12, 2 (1988) 67-73 29. Arbib, C., G.F. Italiano, A. Panconesi, "Predicting deadlock in store-and-forward networks", Networks 20 (1990) 861-881. 30. 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 31. Arbib, C., "A polynomial characterization of some graph partitioning problems", Information Processing Letters 26 (1987/88) 223-230