DSpace Repository

Sequencing Games without Initial Order

Show simple item record

dc.creator Klijn, Flip
dc.creator Sánchez, Estela
dc.date 2007-11-05T10:23:01Z
dc.date 2007-11-05T10:23:01Z
dc.date 2004-09-06
dc.date.accessioned 2017-01-31T00:57:52Z
dc.date.available 2017-01-31T00:57:52Z
dc.identifier http://hdl.handle.net/10261/1788
dc.identifier.uri http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1788
dc.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
dc.description 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.
dc.description 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.
dc.language eng
dc.relation UFAE and IAE Working Papers
dc.relation 622.04
dc.rights openAccess
dc.subject Sequencing
dc.subject Cooperative games
dc.title Sequencing Games without Initial Order
dc.type Documento de trabajo


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account