applying robust optimization to solve product mix problem in automotive industries in this article, applying robust optimization in product mix problem in automotive industries is presented. the problem includes determining both the quantity and the identification of each product to produce to maximize profit. at first, the deterministic model will be presented. then, robust model of product mi...

In this paper, we introduce a new combinatorial optimization problem entitled the color mix (CMP), which is more general case of grey pattern quadratic assignment (GP-QAP). Also, propose an original hybrid genetic-iterated tabu search algorithm for heuristically solving CMP. addition, present both analytical solutions and graphical visualizations obtained solutions, clearly demonstrate excellen...

In this paper we address the decision of choosing a patient mix for a hospital that leads to the most beneficial treatment case mix. We illustrate how capacity, case mix and patient mix decisions are interrelated and how understanding this complex relationship is crucial for achieving the maximum benefit from the fee-for-service financing system. Although studies to determine the case mix that ...

In this paper we address the decision of choosing a patient mix for a hospital that leads to the most beneficial treatment case mix. We illustrate how capacity, case mix and patient mix decisions are interrelated and how understanding this complex relationship is crucial for achieving the maximum benefit from the fee-for-service financing system. Although studies to determine the case mix that ...

this paper deals with the product mix problem using the concept of theory of constraints (toc). theory of constraints is one of the most efficient approaches which have been applied to solve the product mix problem heuristically. although there are numerous heuristic and meta-heuristics to solve this problem, finding the optimal solution in a reasonable time is still a challenging issue. in thi...