Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

Article Abstract:

A polyhedron scheduling process for unit time operations of parallel machines and open shop machine problems is constructed. This process aims at minimizing non-decreasing separable objective function of time taken for completing jobs.

United Kingdom, Science & research, Research, Methods

---

Fixed interval scheduling: models, applications, computational complexity and algorithms

Article Abstract:

A study on interval scheduling problems with relation to solution algorithms is presented.

Analysis, Usage, Algorithms, Algorithm, Intervals (Mathematics)

---

Similar abstracts:

• Abstracts: A fast tabu search algorithm for the permutation flow-shop problem
• Abstracts: Strip generation algorithms for constrained two-dimensional two-staged cutting problems. A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
• Abstracts: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. Project success: lessons from the Andria case
• Abstracts: Positive half-products and scheduling with controllable processing times. Scheduling with controllable release dates and processing times: Makespan minimization

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