On the Convexity of Step Out – Step in Sequencing Games

The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an arbitrary coalition in a SoSi sequencing game. In particular, we use that in determining an optimal processing order of a coalition S U {i}, the algorithm can start from the optimal processing order found for coalition S and thus all information on this optimal processing order of S can be used

MoreLess

Year of publication:	2016
Authors:	Musegaas, Marieke
Other Persons:	Borm, Peter (contributor) ; Quant, Marieke (contributor)
Publisher:	[2016]: [S.l.] : SSRN
Subject:	Scheduling-Verfahren \| Scheduling problem \| Algorithmus \| Algorithm \| Konvexe Optimierung \| Convex optimization

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012978678