Estimados co-Kopperos. Nuestra era es la de Advanced Difficulty (AD), Parker (1995). Cabe anotar que así como nosotros vivimos en AD, también hubo gente que le tocó vivir en el BC (Before Complexity). Jain y Meeran (1999):
“During the 1970s and until the mid 1980s the emphasis was placed on justifying the complexity. Numerous works spanning from Cook (1971) to Lawler et al. (1982) clearly highlighted the extreme intractability of deterministic job shop scheduling problems demonstrating that only a very few special instances are solvable in polynomial time. As a result Parker (1995) refers to the era before 1970 as BC (Before Complexity). Consequently we designate the era since then as AD (Advanced Difficulty). The AD research soon showed that the problems which were solved as a specific instance in the 1950s as well as many others are NP-Hard problems if they are generalised.”
Parker, R.G., 1995. Deterministic Scheduling. Chapman and Hall, London.
A. S. Jain and S. Meeran, Deterministic job-shop scheduling: Past, present and future, European Journal of Operational Research 113 (1999), no. 2, 390-434.
“During the 1970s and until the mid 1980s the emphasis was placed on justifying the complexity. Numerous works spanning from Cook (1971) to Lawler et al. (1982) clearly highlighted the extreme intractability of deterministic job shop scheduling problems demonstrating that only a very few special instances are solvable in polynomial time. As a result Parker (1995) refers to the era before 1970 as BC (Before Complexity). Consequently we designate the era since then as AD (Advanced Difficulty). The AD research soon showed that the problems which were solved as a specific instance in the 1950s as well as many others are NP-Hard problems if they are generalised.”
Parker, R.G., 1995. Deterministic Scheduling. Chapman and Hall, London.
A. S. Jain and S. Meeran, Deterministic job-shop scheduling: Past, present and future, European Journal of Operational Research 113 (1999), no. 2, 390-434.
Posts
No comments:
Post a Comment