Process selection and sequencing in a two-agents production system

4OR

Volumn 1, Issue 2, 2003, Pages 103-119

  Agnetis, Alessandro ^a   Detti, Paolo ^a   Meloni, Carlo ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b POLITECNICO DI BARI   (Italy)

Author keywords

algorithms; network flows; operations management; sequencing

Indexed keywords

EID: 34548698167     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-002-0007-x     Document Type: Article

References (11)

1. Agnetis A, Detti P, Meloni C, Pacciarelli D (2001) Set-up coordination between two stages of a supply chain. Annals of Operations Research 107: 15-32.
2. Agnetis A, Detti P, Meloni C, Pacciarelli D (2000) A linear algorithm for the Hamiltonian completion number of the line graph of a tree. Information Processing Letters 79(1): 17-24.
3. Agnetis A, Mirchandani, PB, Pacciarelli D, PacificiA (2001) Scheduling Problems with Two Competing Users. Università di Roma Tre, Dipartimento di Informatica e Automazione, RT-DIA 67-01.
4. Askin RG, Standridge RC (1992) Modeling and Analysis of Manufacturing Systems. J. Wiley & Sons, NewYork.
5. Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
6. ChenY, PengY, Finin T, LabrouY, Cost S, Chu B, Yao J, Sun R, Wilhelm B (1999) A negotiation-based multi-agent system for supply chain management. Proc. of the Agents'99Workshop "Agent-Based Decision-Support for Managing the Internet-Enabled Supply-Chain", pp. 15-20, Seattle, WA.
7. Detti P, Meloni C (2001) A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. Technical Report no. 450, CentroVitoVolterra, Università degli Studi TorVergata, Roma.
8. Huang X, Hallam JC (1995) Spring-Based Negotiation for Conflict Resolution in AGV Scheduling. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics.
9. Kim K, Poulon BC, Petrie CJ, Lesser VR (2000) Compensatory Negotiation for Agent-Based Project Schedule Coordination. CIFEWorking Paper #55, Stanford University.
10. Raychaudhuri A (1995) The total interval number of a tree and the Hamiltonian completion number of its line graph. Information Processing Letters 56: 299-306.
11. Van Brussel H, Bongaerts L, Wyns J, Valckenaers P, Van GinderachterT (1999)A Conceptual Framework for Holonic Manufacturing: Identification of Manufacturing Holons. Journal of Manufacturing Systems 18(1): 35-52.