Implementation of Bin Packing Model for Reed Switch Production Planning
This paper presents a form to resolve a real problem of efficient material election in reed switch manufacturing. The carrying out of the consumer demands depends on the stochastic results of the classification process where each lot of switches is distributed into bins according to an electric measure value. Various glass types are employed for the switch manufacturing. The effect caused by the glass type variation on the switch classification results was investigated. Based on real data statistic analysis, the problem is reduced to the lot number minimizing taking into consideration the glass type, and interpreted as a bin packing problem generalization. On difference to the classic bin packing problem, in the considered case, an item represents a set of pieces; a container is divided into a number of bins (sub-containers); the bin capacity is variable; there are the assignment restrictions between bins and sets of pieces; the items are allowed to be fragmented into bins and containers. The problem has a high complexity. A heuristic offline algorithm is proposed to find the quantity, types and packing sequence of containers, the item fragments associated with containers and bins. The bin capacities do not affect the algorithm.