Balancedness of sequencing games with multiple parallel machines

Research output: Book/ReportReportAcademic

179 Downloads (Pure)


We provide simple constructive proofs of balancedness of classes of m-PS games, which arise from sequencing situations with m parallel machines. This includes the setting that is studied by Calleja et al. (2001) and Calleja et al. (2002), who provided a complex constructive proof and a simple non-constructive proof of balancedness of a restricted class of 2-PS games, respectively. Furthermore, we provide two counterexamples to illustrate that our balancedness results cannot be extended to a general setting.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages13
ISBN (Print)90-386-1618-X
Publication statusPublished - 2003

Publication series

NameBETA publicatie : working papers
ISSN (Print)1386-9213


Dive into the research topics of 'Balancedness of sequencing games with multiple parallel machines'. Together they form a unique fingerprint.

Cite this