TY - BOOK
T1 - Balancedness of sequencing games with multiple parallel machines
AU - Slikker, M.
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
M3 - Report
SN - 90-386-1618-X
T3 - BETA publicatie : working papers
BT - Balancedness of sequencing games with multiple parallel machines
PB - Technische Universiteit Eindhoven
CY - Eindhoven
ER -