✦ LIBER ✦

Tabu search methods for a single machine scheduling problem

✍ Scribed by Manuel Laguna; J. Wesley Barnes; Fred W. Glover

Publisher: Springer US
Year: 1991
Tongue: English
Weight: 965 KB
Volume: 2
Category: Article
ISSN: 0956-5515
DOI: 10.1007/bf01471219

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new tabu search procedure for an audit

A new tabu search procedure for an audit-scheduling problem

✍ Peter Brucker; Doris Schumacher 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 141 KB 👁 1 views

We consider the following version of the auditing problem. A set of jobs must be processed by auditors A , . . . , A K . Each job consists of several tasks and there may be precedence constraints between these tasks. There is a due date associated with each job. Each auditor is available during disj

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

Problem difficulty for tabu search in jo

Problem difficulty for tabu search in job-shop scheduling

✍ Jean-Paul Watson; J.Christopher Beck; Adele E. Howe; L.Darrell Whitley 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from sim

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 GRASP™ for a difficult single machine

A GRASP™ for a difficult single machine scheduling problem

✍ Thomas A. Feo; Krishnamurthi Venkatraman; Jonathan F. Bard 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 976 KB

A tabu search algorithm for the multi-tr

A tabu search algorithm for the multi-trip vehicle routing and scheduling problem

✍ José Brandão; Alan Mercer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 907 KB

This paper describes a novel tabu search heuristic for the multi-trip vehicle routing and scheduling problem (MTVRSP). The method was developed to tackle real distribution problems, taking into account most of the constraints that appear in practice. In the MTVRSP, besides the constraints that are c