English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/1788
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Sequencing Games without Initial Order

AuthorsKlijn, Flip ; Sánchez, Estela
KeywordsSequencing
Cooperative games
Issue Date6-Sep-2004
SeriesUFAE and IAE Working Papers
622.04
AbstractIn 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.
DescriptionTrabajo 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
URIhttp://hdl.handle.net/10261/1788
Appears in Collections:(IAE) Informes y documentos de trabajo
Files in This Item:
File Description SizeFormat 
62204.pdf187,53 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.