On the Convexity of Precedence Sequencing Games

Herbert Hamers, Flip Klijn and Bas Velzen

Annals of Operations Research, 2005, vol. 137, issue 1, 175 pages

Abstract: In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. We show that these sequencing games are convex if the initial order of the jobs is a concatenation of chains. Copyright Springer Science + Business Media, Inc. 2005

Keywords: cooperative games; sequencing situations (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-2252-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: On the Convexity of Precedence Sequencing Games (2002)
Working Paper: On the Convexity of Precedence Sequencing Games (2002)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:137:y:2005:i:1:p:161-175:10.1007/s10479-005-2252-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-005-2252-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().