Heuristics and exact algorithms for solving the Monden problem

Article Abstract:

The Monden problem involving the sequencing of items on an assembly line for the regulation of resource requirements is investigated. Specifically, the problem, is equivalent to the search for a minimum path in an associated graph. Since it may be solved using a heuristic known as goal-chasing, several solutions based on improved variants of the heuristic are developed. In addition, an exact algorithm based on bounded dynamic programming is also presented.

Operations research, Management science, Cases, Assembly-line methods, Assembly lines

---

Approximate and exact algorithms for the fixed-charge knapsack problem

Article Abstract:

Solutions derived by branch-and-bound algorithm in classical binary knapsack problem are examined.

United States, Science & research, Evaluation, Branch and bound algorithms, Binary system (Mathematics)

---

Exact and heuristic algorithms for data sets reconstruction

Article Abstract:

Algorithms for the data set reconstruction problem, based on dynamic programming, are presented.

Usage, Algorithms

Similar abstracts:

• Abstracts: Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem. Stability analysis of an optimal balance for an assembly line with fixed cycle time
• Abstracts: Issues in the implementation of the DSD algorithm for the traffic assignment problem. A continuous whole-link travel time model with occupancy constraint
• Abstracts: An exact algorithm for the capacitated facility location problems with single sourcing. A method for the cutting stock problem with different qualities
• Abstracts: Coal blending optimization under uncertainty. On solving a variation of the assignment problem. Goal programming and data envelopment analysis (GoDEA) for target-based multi-level planning: allocating central grants to the Greek local authorities
• Abstracts: Guess who's running the company? Men of steal. Unhappy with the service: public criticizes its public servants

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