๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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 for the res
โœ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

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

A branch-and-bound algorithm with fuzzy
โœ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 697 KB

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

Protein tertiary structure prediction us
โœ Volker A. Eyrich; Daron M. Standley; Anthony K. Felts; Richard A. Friesner ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 217 KB ๐Ÿ‘ 2 views

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

A branch and bound algorithm for single
โœ Theodore G. Voutsinas; Costas P. Pappis ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

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