Br. Sarker et Jf. Yu, LOT-SIZING AND CYCLIC SCHEDULING FOR MULTIPLE PRODUCTS IN A FLOW-SHOP, Computers & industrial engineering, 30(4), 1996, pp. 799-808
This paper considers a production-inventory system in which optimal ba
tch sizes are determined for n products that are processed on m machin
es in a flow shop. The total cost function for this system is derived
by considering three cost components: inventory cost in work-in-proces
s, the final products inventory cost and the machine setup labor cost.
In order to make the optimal solution realizable, it is assumed that
all products have the same processing cycle time, The capacity constra
int considered during the derivation of the optimal lot sizes acts as
an additional constraint. Two heuristic algorithms are developed in or
der to obtain the optimal solution. An important part of these algorit
hms is the modeling of the recursive relations among the production wa
iting times and machine idle times. These algorithms are not only used
in deriving the optimal solution but also in providing the production
schedules. A numerical example is also demonstrated along with the co
nclusion and indication for future research. Copyright (C) 1996 Elsevi
er Science Ltd