𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu search approach for the flow shop scheduling problem

✍ Scribed by M. Ben-Daya; M. Al-Fawzan

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
788 KB
Volume
109
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

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 that has not been considered before. These new features result in an implementation that improves upon previous tabu search implementations that use mechanisms of comparable simplicity. Also, better results were obtained than those produced by a simulated annealing algorithm from the literature. @ 1998 Elsevier Science B.V.

πŸ“œ SIMILAR VOLUMES

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 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 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