TEKS: Chapter 111. Mathematics See All Teacher Resources

111.46.c.3

(3) Planning and scheduling. The student uses heuristic algorithms to solve real-world problems. The student is expected to:

• (A) use the list processing algorithm to schedule tasks on identical processors;

• (B) recognize situations appropriate for modeling or scheduling problems;

• (C) determine whether a schedule is optimal using the critical path method together with the list processing algorithm;

• (D) identify situations appropriate for modeling by bin packing;

• (E) use any of six heuristic algorithms to solve bin packing problems;

• (F) solve independent task scheduling problems using the list processing algorithm; and

• (G) explain the relationship between scheduling problems and bin packing problems.