Bounds for nested knapsack problems

Article Abstract:

Majority of algorithms for solving knapsack problems typically use implicit enumeration approaches. Different bounds based on the remaining capacity of the knapsack and items not yet included at a certain iteration have been proposed for use in these algorithms. Similar methods may be used for a nested knapsack problem as long as there is an established procedure for testing whether an item inserted into a knapsack at one stage can also be inserted at the following stages.

Research, Algorithms

---

A new model for complete solutions to one-dimensional cutting stock problems

Article Abstract:

The new model does not require pre-specification of cutting patterns and it resolves the non-linearity in the one-dimensional cutting stock problem. It explicitly includes practical constraints such as sequence related constraints, minimum run length constraints and pattern cardinality constraints.

Cost Control Techniques, Methods, Integer programming, Cost control, Cost reduction

---

Tabu search algorithms for job-shop problems with single transport robot

Article Abstract:

The job-shop scheduling problem for job transportation between machines using single transport robot is analyzed. Tabu search algorithms are used to generalize the problem.

Germany, Transportation, Models, Workshops (Production), Workshops (Work spaces)

Similar abstracts:

• Abstracts: Data dependent worst case bounds for weighted set packing. Improved local search algorithms for the rectangle packing problem with general spatial costs
• Abstracts: An iterative algorithm for scheduling UET tasks with due dates and release times. Insertion techniques for static and dynamic resource-constrained project scheduling
• Abstracts: Models, applications and linear programming relaxation. Beam search heuristic to solve stochastic integer problems under probabilistic constraints
• Abstracts: Project review and learning in the construction industry: embedding a problem structuring methods within a partnership context
• Abstracts: Modeling staff scheduling problems: a tutorial. Parallel machine scheduling with a convex resource consumption function

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.