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

A scheduling algorithm for flexible flow lines with limited intermediate buffers

โœ Scribed by Sawik, Tadeusz J.

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
681 KB
Volume
9
Category
Article
ISSN
8755-0024

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

A simple semi on-line algorithm for P2//
A simple semi on-line algorithm for P2//Cmax with a buffer
โœ Guochuan Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

In this paper, we investigate a semi on-line version of the parallel machine scheduling problem. We are given a buffer of length k which is available to maintain k jobs. The jobs arrive one by one and can be temporarily assigned to the buffer if the buffer is not full. The goal is to assign all jobs