𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new heuristic method for the flow shop sequencing problem

✍ Scribed by Marino Widmer; Alain Hertz

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
519 KB
Volume
41
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The fixed charge problemβ€”I: A new heuris
The fixed charge problemβ€”I: A new heuristic method
✍ Leon Cooper πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 351 KB

s-A new approximate method for finding optimal or near optimal solutions to the fixed charge problem is described. It is very rapid. compared with previous methods and achieves results which are at least as good or better than previously published results. The method is useful in its own right. Howe

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.