and Lenstra J.K. 2004. Minimizing Makespan in a TwoMachine Flow Shop with Delays and Unit-Time Operations is NP-Hard. *J. Scheduling* 7(5): 333-348.

[Zuckerman, Procaccia, & Rosenschein 2008] Zuckerman, M.; Procaccia, A.; and Rosenschein, J. 2009. Algorithms for the coalitional manipulation problem. Artificial Intelligence. 173(2):392-412.