✦ LIBER ✦

Algorithms for packing and scheduling problems

✍ Scribed by Michele Monaci

Publisher: Springer
Year: 2003
Tongue: English
Weight: 37 KB
Volume: 1
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-002-0011-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for restricted b

A linear time algorithm for restricted bin packing and scheduling problems

✍ J. Baewicz; K. Ecker 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Genetic algorithms for flowshop scheduli

Genetic algorithms for flowshop scheduling problems

✍ Tadahiko Murata; Hisao Ishibuchi; Hideo Tanaka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Comparing online algorithms for bin pack

Comparing online algorithms for bin packing problems

✍ Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 415 KB

Nature inspired genetic algorithms for h

Nature inspired genetic algorithms for hard packing problems

✍ Philipp Rohlfshagen; John A. Bullinaria 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 670 KB

Application of genetic algorithm for sch

Application of genetic algorithm for scheduling and schedule coordination problems

✍ Prabhat Shrivastava; S. L. Dhingra; P. J. Gundaliya 📂 Article 📅 2002 🏛 Institute for Transportation Inc. 🌐 English ⚖ 859 KB

Efficient Approximation Algorithms for T

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

✍ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add