A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem

Article Abstract:

In a single-machine total weighted tardiness scheduling problem the processing time of a job depends on starting time of the job. In such a situation a multi-start dynasearch algorithm is used to optimize the time dependent combinatorial problems.

France, Combinatorial optimization, Search theory

---

A new dominance rule to minimize total weighted tardiness with unequal release dates

Article Abstract:

A new dominance rule is proposed, taking into account time-dependent orderings between a pair of jobs relating to the single machine total weighted tardiness problem.

Operations Research, Management science, Models

---

A tabu search algorithm for the single machine total weighted tardiness problem

Article Abstract:

Application of heuristics for performance of Tabu search as part of total weighted tardiness minimization during single machine scheduling is described.

Production Management, Turkey, Analysis, Heuristic programming

Similar abstracts:

• Abstracts: A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem. Coordinated ordering decisions for short life cycle products with uncertainty in delivery time and demand
• Abstracts: The use of genetic algorithms to solve the economic lot size scheduling problem. Basket problems in margin calculation: Modelling and algorithms
• Abstracts: Performance enhancements to tabu search for the early/tardy scheduling problem. Minimizing mean squared deviation of completion times with maximum tardiness constraint
• Abstracts: Cluster based branching for the asymmetric traveling salesman problem. Comments on properties of the minmax solutions in goal programming
• Abstracts: An expanding-core algorithm for the exact 0-1 knapsack problem. Budgeting with bounded multiple-choice constraints

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