A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates

Article Abstract:

The problem of minimizing the total tardiness of a single machine that has to perform more number of jobs is examined. New lower bounds, new constraint propagation techniques and new dominance properties, which are proposed to solve the problem, have outperformed the best known procedures.

Production planning

---

On minimizing the weighted number of late jobs in unit execution time open-shops

Article Abstract:

The unit execution time open-shops with integer release dates are studied. The minimum weighted number of late jobs can be computed in polynomial time by dynamic programming.

Analysis, Dynamic programming, Closed shop

---

Computing redundant resources for the resource constrained project scheduling problem

Article Abstract:

Application of heuristics for calculation of lower bounds of redundant functions, to solve resource constrained project scheduling problem, is described.

Industrial project management, Project management, Usage, Heuristic programming

Similar abstracts:

• Abstracts: Rescheduling of identical parallel machines under machine eligibility constraints. Preemptive scheduling on identical parallel machines subject to deadlines
• Abstracts: On two single machine scheduling problems with fuzzy processing times and fuzzy due dates. On the equivalence of two optimization methods for fuzzy linear programming problems
• Abstracts: One-dimensional cutting stock problem to minimize the number of different patterns. A path relinking approach with ejection chains for the generalized assignment problem
• Abstracts: Meal makers hard pressed to meet demand. New investment being planned in Russia with: massive quota rights savings
• Abstracts: BA raises offer to ground staff; response is muted. Two U.K. airlines report traffic gains. British Airways posts higher net, helped by strong business traffic

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