Article

A heuristic rule for relocating blocks

---

One of the most important objectives of the storage and pickup operations in block stacking systems is to minimize the number of relocations during the pickup operation. This study suggests two methods for determining the locations of relocated blocks. First, a branch-and-bound (B&B) algorithm is suggested. Next, a decision rule is proposed by using an estimator for an expected number of additional relocations for a stack. The performance of the decision rule was compared with that of the B&B algorithm.

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

ATC LO PYO a

Penerbit

Korea : Elsevier., 2004

Deskripsi Fisik

15 p.

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

LO

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

online resource

Edisi

-

Subjek

Relocation
Block stacking
Branch and bound algorithm
Heuristic rule

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Gyu-Pyo Hong

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar