1. Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pacific J Oper Res 18:193–242
2. Baker KR, Trietsch D (2009) Principles of sequencing and scheduling. Wiley, New york
3. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. Freeman, San Francisco
4. Graham RL, Lawler EL, Lenstra JK, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
5. Karp RM (1972) Reducibility among combinatorial problems: complexity of computer computations. Plenum Press, New York, pp 85–103