A tabu search approach for the flow-shop scheduling problem

Article Abstract:

An improved tabu search approach for the permutation flow shop scheduling problem is presented and results show that the solutions are better than the simulated annealing algorithm. The approach requires an initial sequence, a mechanism for generating some neighborhood of the current sequence, a tabu list and stopping criteria. Additional elements that may prove useful include aspiration criterion, intensification scheme and diversification scheme.

Production Mgmt NEC, Production management, Shop floor control

---

A simulated annealing approach for the one-machine mean tardiness scheduling problem

Article Abstract:

A simulated annealing approach for solving the single machine mean tardiness tardiness scheduling problem is proposed. A simulated experiment shows that the proposed method provides better solutions than two previous heuristics with good results. The solutions obtained by the proposed algorithm are less than 1% of the optimal solution. The simulated annealing approach can also be used to improve the solution obtained using other methods.

---

Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models

Article Abstract:

A method of solving the scheduling problems associated with multi-mode resource constrained project, which generate positive discounted cash flows, is presented. Four different payment models are considered for the project. Simulated annealing and tabu search are suggested for solving the problems associated with scheduling.

Poland, Analysis, Resource allocation

Similar abstracts:

• Abstracts: Heuristic approaches for n/m/F/sigma Ci scheduling problems. Heuristic procedure for minimizing makespan and the number of required pallets
• Abstracts: An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. Optimal procedures for the discrete time/cost trade-off problem in project networks
• Abstracts: A Lagrangean heuristic for the pk-median dynamic location problem. A Lagrangean heuristic for the maximal covering location problem
• Abstracts: Links for the future. Building inroads. Making inroads in Asia
• Abstracts: A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs. Path colorings in bipartite graphs

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