Scheduling to minimize the total resource consumption with a constraint on the sum of completion times

Article Abstract:

A study was conducted to examine the problem of single and parallel machine-scheduling with constrained total job completion time and variable release times. The results showed that in general, the problem is NP-hard. Moreover, it is polynomial time solvable if resource consumption function is linear. Determining the complexity of the single machine problem when resource consumption function is convex and some other problems that need to be analyzed are presented.

---

Resource-constrained job scheduling with recyclable resources

Article Abstract:

A new resource classification called recyclable has been added to resource-constrained job scheduling. Two approaches were tested to solve the single-machine static job scheduling problem. Resource-constrained job scheduling with recyclable resources was found to be applicable to several problems but was particularly beneficial in solving flexible manufacturing system scheduling.

---

A multicriteria heuristic method to improve resource allocation in multiproject scheduling

Article Abstract:

Research is presented describing the study of project management scheduling of schemes where several tasks are undertaken at the same time and heuristic controls are required.

Multiple criteria decision making, Project management systems, Project management software

Similar abstracts:

• Abstracts: Vitkovice supplies the Melnik power station New contracts on the supplies of full plant equipment. A contract on an Internet transaction has been arranged successfully
• Abstracts: Putting the bounce back into Matsushita. Machines with minds of their own. The next small thing
• Abstracts: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
• Abstracts: Scheduling multiple variant programs under hard real-time constraint. A cutting plane algorithm for a single machine scheduling problem
• Abstracts: Evaluation of leading heuristics for the single machine tardiness problem. A comparison of stochastic scheduling rules for maximizing project net present value

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