✦ LIBER ✦

An exponential neighborhood for a one-machine batching problem

✍ Scribed by Johann Hurink

Publisher: Springer
Year: 1999
Tongue: German
Weight: 129 KB
Volume: 21
Category: Article
ISSN: 0171-6468
DOI: 10.1007/s002910050098

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for a one machine

A polynomial algorithm for a one machine batching problem

✍ David F Shallcross 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 329 KB

An exponential (matching based) neighbor

An exponential (matching based) neighborhood for the vehicle routing problem

✍ Eric Angel; Evripidis Bampis; Fanny Pascual 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 339 KB

On the optimal policies of an exponentia

On the optimal policies of an exponential machine repair problem

✍ Tapani Lehtonen 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 492 KB

A tabu search approach for a single-mach

A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour

✍ Johann Hurink 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 153 KB 👁 1 views

In this paper we present a tabu search approach for a single-machine batching problem. A set of jobs has to be scheduled on a batching machine. This machine is able to handle several jobs simultaneously. The time for processing a subset of jobs simultaneously is equal to the sum of the processing ti

A study of exponential neighborhoods for

A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem

✍ Vladimir G. De&ıbreve;neko; Gerhard J. Woeginger 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 240 KB

One problem involving determination of a

One problem involving determination of an optimum procedure for setting up a machine

✍ Yu. A. Zak 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 607 KB