Iterative restart technique for solving timetabling problems

Article Abstract:

The complete search algorithms with good heuristics are unable to solve large instances of employee timetabling problems (ETPs). A new iterative algorithm with restart techniques is introduced and its behavior on random timetabling problems is analyzed.

Workers

---

Memetic algorithm timetabling for non-commercial sport leagues

Article Abstract:

Automatic generation of timetables for non-commercial sport leagues is presented. Limited access to sport facilities and temporary non-availability of sportsmen in non-commercial leagues is stressed by the example of table-tennis.

Analysis, Scheduling (Management)

---

A mathematical programming-based scheduling framework for multitasking environments

Article Abstract:

A model for efficient and optimal multitasking process, using algorithms, is presented.

Europe, Multitasking, Multitasking (Computing), Concurrent programming

Similar abstracts:

• Abstracts: Asean faces new challenges. Resolving Asean's problems
• Abstracts: An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• Abstracts: A simple Tabu search method to solve the mixed-integer linear bilevel programming problem. A note on a modified simplex approach for solving bilevel linear programming problems
• Abstracts: Multicriteria adaptive paths in stochastic, time-varying networks. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Abstracts: Outsmart allergies for good!. Clean this way to end tiredness. Allergy medication is hidden cause of seasonal tiredness

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