Minimizing total tardiness in permutation flowshops

Article Abstract:

The permutation flowshop scheduling problem is analyzed to pinpoint ways of minimizing total tardiness. An optimal solution algorithm is proposed as a solution for the problem. The results showed that algorithm performance was sensitive to the tardiness factor although this sensitivity is not expected to be influenced by other bounding schemes or dominance criteria. Tighter bounds and better dominance rules can also be adopted for the problem.

Permutations

---

Algorithms for a class of single-machine weighted tardiness and earliness problems

Article Abstract:

Optimal job sequence in machine operations requires proper starting times for different jobs. Improper job starting time priority generates operational costs. However, the addition of new jobs, job scheduling and valid dominance results have to be balanced considerably to avoid sequence elimination problems. New job additions should not be placed at the beginning of a sequence to avoid job delays.

Algorithms, Sequential machine theory

---

Scheduling on parallel identical machines to minimize total tardiness

Article Abstract:

A branch and bound algorithm for scheduling independent jobs on identical parallel machines, with minimum total tardiness, is presented.

South Korea, Methods, Usage, Parallel processing

Similar abstracts:

• Abstracts: Short-term booking of air cargo space. Using genetic algorithms for single-machine bicriteria scheduling problems
• Abstracts: A heuristic algorithm for the asymmetric capacitated vehicle routing problem. A clustering algorithm for item assignment in a synchronized zone order picking system
• Abstracts: Mazda sales zoom ahead in Europe, U.S.: net falls. Auto makers shift to offset effects of soaring euro. German top car makers defy sluggish market
• Abstracts: Scania net soars as demand rises for heavy trucks. VW's stalled plan to combine truck businesses may help rivals
• Abstracts: M and A milestone: $101 billion deal for ABN Amro: group set to dismember 183-year-old bank; will buyers regret it?

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