✦ LIBER ✦

A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots

✍ Scribed by Adar A. Kalir; Subhash C. Sarin

Book ID: 114230713
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 106 KB
Volume: 29
Category: Article
ISSN: 0305-0483
DOI: 10.1016/s0305-0483(01)00046-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Solutions for the Single Batch,

Optimal Solutions for the Single Batch, Flow Shop, Lot-streaming Problem with Equal Sublots

✍ Adar A. Kalir; Subhash C. Sarin 📂 Article 📅 2001 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 483 KB

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.