Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference24 articles.
1. Blocher JD, Chand S (1991) Scheduling of parallel processors: a posterior bound on LPT sequencing and a two-step algorithm. Naval Res Logist 38:273–287
2. Blocher JD, Sevastyanov S (2015) A note on the Coffman–Sethi bound for LPT scheduling. J Sched 18:325–327
3. Chen B (1993) A note on LPT scheduling. Oper Res Lett 14:139–142
4. Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. In: Du DZ, Pardalos P (eds) Handbook of combinatorial optimization, vol 3. Kluwer Academic, Dordrecht, pp 21–169
5. Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47:271–292