An linear programming based lower bound for the simple assembly line balancing problem

Article Abstract:

The simple assembly line balancing problem is a classical integer programming problem. A new lower bound integer programming formulation is proposed to solve this problem.

Usage, Integer programming

---

Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds

Article Abstract:

The problem of cost-oriented assembly line balancing is examined. The various model formulations and upper and lower bounds for this problem are discussed.

Models, Economic aspects

---

A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs

Article Abstract:

The mixed-model assembly line balancing problem in operations management is addressed by using branch-and-bound technique.

Production Management

Similar abstracts:

• Abstracts: An integer programming formulation for a case study in university timetabling. Data mining for decision support on customer insolvency in telecommunications business
• Abstracts: A branch-and-bound algorithm for the mini-max spanning forest problem. An improved algorithm to determine lower bounds for fixed spectrum frequency assignment problem
• Abstracts: Mathematical programming approach to the Petri nets reachability problem. The shift team formation problem in multi-shift manufacturing operations
• Abstracts: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem. Sequential selection procedures: using sample means to improve efficiency
• Abstracts: Joint statistical design of doubt sampling X and s charts. A new approach to solving the multiple traveling salesperson problem using genetic algorithms

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