Sequencing Games without Initial Order

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1788

Title:	Sequencing Games without Initial Order
Keywords:	Sequencing Cooperative games
Description:	Trabajo publicado como artículo en Mathematical Methods of Operations Research 63(1): 53-62 (2006).-- http://dx.doi.org/10.1007/s00186-005-0012-x In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times. F. Klijn’s research is supported by a Ramón y Cajal contract of the Spanish Ministerio de Ciencia y Tecnología. His work is also partially supported by Research Grant BEC2002-02130 from the Spanish Ministerio de Ciencia y Tecnología and by the Barcelona Economics Program of CREA. E. Sánchez acknowledges financial support of the Spanish Ministerio de Ciencia y Tecnología and FEDER through project BEC2002-04102-C02-02.
URI:	http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1788
Other Identifiers:	http://hdl.handle.net/10261/1788
Appears in Collections:	Digital Csic

Files in This Item:

There are no files associated with this item.

DSpace JSPUI