An iterative algorithm for scheduling UET tasks with due dates and release times

Article Abstract:

A new polynomial-time iterative algorithm is presented for the scheduling problem with a unit execution time task system, parallel identical processors, precedence constraints, release times, and the criterion of maximum lateness. The algorithm allows achieving the performance guarantees for the maximum lateness and makespan problems.

---

Insertion techniques for static and dynamic resource-constrained project scheduling

Article Abstract:

A flow network model is presented for the static resource-constrained project scheduling problem. Based on new polynomial insertion algorithm taking advantage on the flow structure, static and dynamic scheduling methods are proposed.

---

Maximization of solution flexibility for robust shop scheduling

Article Abstract:

Flexibility options are seen as key solutions for dealing with uncertainty in shop scheduling with deadlines. Numerous schedule groups are generated for each machine wherein algorithms are used to evaluate operations.

France, Science & research, Management dynamics, Research, Management, Company business management, Dynamic programming, Uncertainty

Similar abstracts:

• Abstracts: Serial and parallel value iteration algorithms for discounted Markov decision processes. Core, least core and nucleolus for multiple scenario cooperative games
• Abstracts: An alternating-move price-setting duopoly model with stochastic costs. Retail price cycles and the presence of small firms
• Abstracts: BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs
• Abstracts: A beautiful friendship? Reporting on the ready-made and its mass of contradictions. No smoking policy
• Abstracts: Boardroom skills for Europe. Visioning the pathway: a leadership process model. Pension fund trustees: role and contribution

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