Learn More
robot scheduling with time-window constraints using a critical path approach. The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming. A comparative study of exact algorithms for the two dimensional strip packing problem. An improved heuristic and an exact algorithm for the 2D strip and bin packing problem. application(More)
  • 1