Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

Article Abstract:

Resource-constrained scheduling problems were analyzed when there was a fixed number of task types and when the processing times were bounded or the number of processors was fixed. Polynomial time algorithms were applied for problems with makespan mean flow time, weighted number of late jobs and sum of tardiness as objective functions. Results for shop problems with multiprocessor tasks and unit processing times where the number of jobs or the number of stages was fixed were calculated.

Models

---

A branch and bound algorithm for the resource-constrained project scheduling problem

Article Abstract:

A branch and bound algorithm was proposed to resolve the resource-constrained project scheduling problem (RCPSP). The branching strategy of the algorithm begins from a graph illustrating a group of conjunctions and disjunctions. It is then either followed by introduction of disjunctive constraints between activity pairs or by grouping such activities in parallel condition.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Research, Analysis, Branch and bound algorithms

---

Lower bounds for resource-constrained project scheduling problems

Article Abstract:

A destructive lower bound for the multi-mode resource-constrained project-scheduling problem with minimal and maximum time-lags is presented. Several test instances of the multi-mode problem with and without time-lags and the single-mode version with time-lags are reported by computational results.

Industrial project management, Algorithm, Resource programs (Education)

Similar abstracts:

• Abstracts: A comparison of two reference point methods in multiple objective mathematical programming. Multiobjective programming methods in the reserve selection problem
• Abstracts: A comparison of two reference point methods in multiple objective mathematical programming. part 2 Relationship between vector variational-like inequality and optimization problems
• Abstracts: Quota fraud trio put up for sale. Industry beats giant port project. Shipyard in talks to build: sleek new-class tuna superseiner
• Abstracts: A graph colouring model for assigning a heterogeneous workforce to a given schedule. Resource-constrained project scheduling: A critical activity reordering heuristic

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