𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast approximation algorithm for job sequencing with deadlines

✍ Scribed by G.V. Gens; E.V. Levner

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
336 KB
Volume
3
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Evolutionary algorithms for flowshop seq
Evolutionary algorithms for flowshop sequencing with non-unique jobs
✍ R.L. Burdett; E. Kozan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 207 KB

Sequencing problems are dicult combinatorial problems because of the extremely large search space of possible solutions and the large number of ``local'' optima that arise. Unlike other NP-hard combinatorial problems, the search space, in general, for sequencing problems (under the makespan objectiv

Fast algorithm for peptide sequencing by
Fast algorithm for peptide sequencing by mass spectroscopy
✍ Christian Bartels πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 435 KB

An automatic algorithm for sequencing polypeptides from fast atom bombardment tandem mass spectra is presented. Based on graph theory considerations it finds the most probable sequences, even if the amino acid composition is unknown, by scoring mass differences. The algorithm is fast as the computin

Random sequencing jobs with deadlines pr
Random sequencing jobs with deadlines problem: Growth of the optimal solution values
✍ Krzysztof SzkatuΕ‚a πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 550 KB

In the paper an asymptotic value of the sequencing jobs with deadlines (SJD) problem is computed for the case of the random SJD problems. It is assumed that problem coefficients are realizations of independent, uniformly distributed over [O,l) random variables, n --) m with deadlines remaining deter