1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
2. B. Chen, C. N. Potts, and G. J. Woeginger, “A Review of Machine Scheduling: Complexity, Algorithms and Approximability,” in Handbook ofCombinatorialOptimization, Vol.3, Ed. by D.-Z. Du and P.M. Pardalos (Kluwer Acad. Publ., Dordrecht, 1998), pp. 21–169.
3. M. Drozdowski, Scheduling for Parallel Processing (Springer, London, 2009).
4. C. W. Duin and E. V. Sluis, “On the Complexity of Adjacent Resource Scheduling,” J. Scheduling 9 (1), 49–62 (2006).
5. C. Bierwirth and F. Meisel, “A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals,” European J. Oper. Res. 244 (3), 675–689 (2015).