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

A Hybrid Meta-Heuristic for the Batching Problem in Just-In-Time Flow Shops

โœ Scribed by Mesut Yavuz; Elif Akcali; Suleyman Tufekci

Publisher
Springer Netherlands
Year
2006
Tongue
English
Weight
354 KB
Volume
5
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Batch-scheduling problems to minimize in
Batch-scheduling problems to minimize inventory cost in the shop with both receiving and delivery just-in-times
โœ Abdul Hakim Halim; Hiroshi Ohta ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 820 KB

If the shop capacity is tight, it may not be possible to make a schedule that leads the completion times of all the parts processed in the shop to be exactly at their due dates. As a result, the shop may have to incur a holding cost for the parts finished earlier. This paper addresses a multi-due-d

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.