Optimal clustering of frequency-constrained maintenance jobs with shared set-ups

Article Abstract:

Maintenance engineers are experiencing difficulties with frequency-constrained maintenance jobs since these jobs require varying degrees of joint execution or clustering rules. Strong dominance rules are required for maintenance jobs with common set-ups. On the other hand, less strong dominance rules are utilized for maintenance jobs with shared set-ups. However, the problem can be eliminated through the use of a heuristic procedure and a branch and bound method.

Usage, Dynamic programming, Maintenance, Heuristic programming, Branch and bound algorithms

---

Balancing U-lines in a multiple U-line facility

Article Abstract:

A reaching dynamic programming algorithm effective in balancing and rebalancing U-line facilities is presented. The algorithm is found to be effective provided U-lines do not have more than 22 tasks and wide, sparse precedence graphs. The algorithm is found to be effective in assigning tasks to a minimum number of irregular, crossover and multiline stations while satisfying constraints and in such a way that idle times are used for improvement efforts.

Production Mgmt NEC, Scheduling (Management), Production management, Assembly-line balancing

---

Similar abstracts:

• Abstracts: An approximation algorithm for solving unconstrained two-dimensional knapsack problems. Tree knapsack approaches for local access network design
• Abstracts: Subjective estimation of the delay time distribution in maintenance modelling. Preventive maintenance with limited historical data
• Abstracts: Two engineering applications of a constrained shortest-path model. A new subtour elimination constraint for the vehicle routing problem
• Abstracts: Strategies for managing Russian international joint venture conflict. Unlocking your imprisoned assets: the joint venture solution
• Abstracts: Using capital markets to finance projects. Risk allocation remains central to PFI. Financing projects in the bond markets

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