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

An optimal batch size for a production system operating under a just-in-time delivery system

โœ Scribed by A.M.M. Jamal; Bhaba R. Sarker

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
552 KB
Volume
32
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

โœฆ Synopsis

The model determines an economic manufacturing quantity and recommends a raw material ordering policy to deliver a fixed amount of finished products at a regular interval within the production cycle time. In this paper, we estimate the batch size from the lower bound concept of the JIT delivery amount. An efficient algorithm is developed to compute the optimal or near optimal batch sizes for both manufacturing and raw material ordering policies. Results and computational complexity of the problem are also discussed

๐Ÿ“œ SIMILAR VOLUMES

A methodology for the vulnerability anal
A methodology for the vulnerability analysis of just-in-time production systems
โœ V. Albino; A.C. Garavelli ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 779 KB

Great emphasis is given by literature to the fragility of just-in-time production systems, due to the different sources of uncertainty which usually affect industrial operations. In this paper, the authors propose a methodology, based on the concept of vulnerability, to evaluate the effect of variab

A dynamic programming algorithm for sche
A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
โœ J. Miltenburg; G. Steiner; S. Yeomans ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 812 KB

## A dynamic programming procedure for determining the optimal just-in-time (JIT) production schedule for a mixed-model facility is presented. Compared to previously available optimization methods it substantially reduces computation and storage requirements, enabling practical-sized problems to b