A graph colouring model for assigning a heterogeneous workforce to a given schedule

Article Abstract:

A heterogeneous workforce assignment problem is examined where the minimum number of workers needed to perform a machine load plan is calculated. The problem is represented as a restricted vertex coloring problem and a branch and bound algorithm is shown. The special characteristics of the graph to be colored enable an efficient application of the branch and bound. Computational results indicate that the algorithm can solve problems of 50 tasks, 5, 10 and 15 machines and between 2 to 15 different kinds of workers in a few seconds.

Models, Resource allocation, Branch and bound algorithms

---

Justification and RCPSP: a technique that pays

Article Abstract:

Findings relating to use of double justification technique in heuristic algorithms for the resource-constrained project scheduling problem are presented. Computational results demonstrate the positive impact of justification technique in improving the quality of schedules.

Science & research, Spain, Research

---

Resource-constrained project scheduling: A critical activity reordering heuristic

Article Abstract:

A new metaheuristic algorithm for the resonance-constrained project-scheduling problem is presented. The procedure is a non-standard implementation of fundamental concepts of tabu search without explicitly using memory structures embedded in a population-based framework.

Algorithms, Algorithm

Similar abstracts:

• Abstracts: Controlling minds. Steering a course for change in education. Mobile solution is at hand to cut through transport's Gordian knot
• Abstracts: The closing of physical transport could open the door to the future. A terminal solution to close the book on our library of problems
• Abstracts: Fighting terror by design. Underground moves
• Abstracts: Backbones and heads provide extra cash. Portions keep skin on to the last! Trawlers using plate ground gear
• Abstracts: Campaigning needs to jettison jargon and improve debate. Heed the sirens' calls when searching for dispute definition

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