A multicriteria scheduling tool using a branch-and-bound algorithm
โ Scribed by Raymond Bausch
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 244 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit
This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi
We report a new method for predicting protein tertiary structure from sequence and secondary structure information. The predictions result from global optimization of a potential energy function, including van der Waals, hydrophobic, and excluded volume terms. The optimization algorithm, which is ba
Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the