๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers

โœ Scribed by Quan-Ke Pan; Ling Wang; Liang Gao

Book ID
113470754
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
657 KB
Volume
11
Category
Article
ISSN
1568-4946

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

An exact algorithm for the batch sequenc
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
โœ A. Agnetis; F. Rossi; G. Gristina ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 295 KB ๐Ÿ‘ 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.