Computing the Nash solution for scheduling bargaining problems

International Journal of Operational Research

Volumn 6, Issue 1, 2009, Pages 54-69

  Agnetis, Alessandro ^a   de Pascale, Gianluca ^a   Pranzo, Marco ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

Complexity NP hardness; Multi agent scheduling; Nash bargaining solution

Indexed keywords

EID: 66949174472     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2009.026243     Document Type: Article

References (14)

1. Agnetis, A., de Pascale, G. and Pacciarelli, D. (2007) 'A Lagrangian approach to single-machine scheduling problems with two competing agents', to appear on Journal of Scheduling.
2. Agnetis, A., Mirchandani, P.B., Pacciarelli, D. and Pacifici, A. (2004) 'Scheduling problems with two competing agents', Operations Research Vol. 52, No. 2, pp.229-242.
3. Albino, V., Carbonara, N. and Giannoccaro, I. (2006) 'Innovation in industrial districts: An agent-based simulation model', International Journal of Production Economics, Vol. 104, pp.30-45.
4. Albino, V., Carbonara, N. and Giannoccaro, I. (2007) 'Supply chain cooperation in industria districts: A simulation analysis', European Journal of Operational Research, Vol. 177, No. 1, pp.261-280.
5. Baker, K.R. and Smith, J.C. (2003) 'A multiple-criterion model for machine scheduling', Journal of Scheduling, Vol. 6, pp.7-16.
6. Brewer, P.J. and Plott, R.P. (1996) 'A Binary Conflict Ascending Price (BICAP) mechanism for decentralized allocation of the right to use railroad tracks', International Journal of Industrial Organization Vol. 14, No. 6, pp.857-886.
7. Bukchin, Y. and Hanany, E. (2007) 'Decentralized cost in scheduling: A game-theorethic approach', Manufacturing and Service Operations Management, Vol. 9, No. 3, pp.263-275.
8. Cheng, T.C.E., Ng, C.T. and Yuan, J.J. (2006) 'Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs', Theoretical Computer Science, Vol. 362, pp.273-281.
9. Curiel, I., Pederzoli, G. and Tijs, S. (1989) 'Sequencing games', European Journal of Operational Research, Vol. 40, pp.344-351.
10. Hain, R. and Mitra, M. (2004) 'Simple sequencing problems with interdepenedent costs', Games and Economic Behavior, Vol. 48, pp.271-291.
11. Mariotti, M. (1998) 'Nash bargaining theory when the number of alternatives can be finite', Social Choice and Welfare, Vol. 15, pp.413-421.
12. Markusen, A. (1996) 'Sticky places in slippery space: A typology of industrial districts', Economic Geography, Vol. 72, No. 3, pp.293-313.
13. Nash, J.F. (1950) 'The bargaining problem', Econometrica, Vol. 18, pp.155-162.
14. Peha, J.M. (1995) 'Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time', Journal of Computers and Operations Research, Vol. 22, No. 10, pp.1089-1100.