𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear time algorithm for restricted bin packing and scheduling problems

✍ Scribed by J. Baewicz; K. Ecker

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
357 KB
Volume
2
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear time bin-packing algorithm
A linear time bin-packing algorithm
✍ Charles U Martel πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 244 KB
A 5/4 Linear Time Bin Packing Algorithm
A 5/4 Linear Time Bin Packing Algorithm
✍ JΓ³zsef BΓ©kΓ©si; GΓ‘bor Galambos; Hans Kellerer πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 195 KB

In 1985, Martel published a linear time algorithm with a 4 3 asymptotic worst-case ratio for the one-dimensional bin packing problem. The algorithm is based on a linear time classification of the sizes of the items, and thereafter according to the number of elements in certain subclasses pairing the

A genetic algorithm methodology for comp
A genetic algorithm methodology for complex scheduling problems
✍ Bryan A. Norman; James C. Bean πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 79 KB πŸ‘ 2 views

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty