A multi-product loading problem: a model and solution method
β Scribed by Umit Yuceer
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 930 KB
- Volume
- 101
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
β¦ Synopsis
An important operational problem arises during the transportation and delivery of several products, which cannot be mixed, in the same vehicle at regular intervals. The vehicle has compartments to keep the products separately. Therefore, a scheme of allocation of compartments which we call vehicle loading problem to maximize the efficiency of the system while the demands for the products at the destination(s) are satisfied. A mixed binary model is developed for this multi-product loading problem. The solution method is based on simultaneously exploring the primal and dual structures derived from the Lagrangian relaxation. Subset sum problems are obtained as subproblems to the partial Lagrangian. An algorithm is developed and its convergence is proved. The efficiency of the method is demonstrated by running randomly chosen test problems. An initial solution finding method is also developed. (~) 1997 Elsevier Science B.V.
π SIMILAR VOLUMES
In the paper, a method for solving fault detection and diagnosis problems in sampled-data stochastic systems is presented. As a main methodology tool the Bayesian view on uncertainty is exploited. The method can be classified as of a multi-model type. It requires to supply mathematical models of the
The balancing problem deals with the assignment of tasks to work stations. We can distinguish two approaches in the literature on the mixed model line balancing problem, that both transform this problem into a single model line balancing problem. These approaches use combined precedence diagrams and
In this paper, an algorithm for the numerical in¨estigation of the generalized slot line ha¨ing a polygonal cross section is proposed. Solution of the eigenmode problem is based on the method, called the domain product technique, which employs a Mathieu function expansion. A good agreement between t
## Abstract A scheduling model for a multiβproduct, multistage batch plant with parallel units is presented. The objective is to maximize the weighted completion times of orders in every processing stage while imposing a penalty on the slower orders. The proposed model uses the continuousβtime repr