✦ LIBER ✦

Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem

✍ Scribed by Peter Greistorfer; Hans Kellerer

Book ID: 110300216
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 217 KB
Volume: 7
Category: Article
ISSN: 1381-1231
DOI: 10.1023/a:1011340311793

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tabu Search Algorithms for Cyclic Machin

Tabu Search Algorithms for Cyclic Machine Scheduling Problems

✍ Peter Brucker; Thomas Kampmeyer 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 737 KB

Tabu search and lower bound for an indus

Tabu search and lower bound for an industrial complex shop scheduling problem

✍ D. Prot; O. Bellenguez-Morineau 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Tabu search methods for a single machine

Tabu search methods for a single machine scheduling problem

✍ Manuel Laguna; J. Wesley Barnes; Fred W. Glover 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 965 KB

Tabu search and lower bounds for a combi

Tabu search and lower bounds for a combined production–transportation problem

✍ Condotta, Alessandro; Knust, Sigrid; Meier, Dimitri; Shakhlevich, Natalia V. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 745 KB

A tabu search heuristic for the quay cra

A tabu search heuristic for the quay crane scheduling problem

✍ Marcello Sammarra; Jean-François Cordeau; Gilbert Laporte; M. Flavia Monaco 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 330 KB

A tabu search approach for the flow shop

A tabu search approach for the flow shop scheduling problem

✍ M. Ben-Daya; M. Al-Fawzan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 788 KB

In this paper, we propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification