نتایج جستجو برای: Machine breakdown and Mathematical programming
تعداد نتایج: 16904947 فیلتر نتایج به سال:
cell formation problem mainly address how machines should be grouped and parts be processed in cells. in dynamic environments, product mix and demand change in each period of the planning horizon. incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. in this model, to ensure the reliability of the system in presence of unreliable machine...
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
This paper presents a new mathematical model to solve cell formation problem in cellular manufacturing systems, where inter-arrival time, processing time, and machine breakdown time are probabilistic. The objective function maximizes the number of operations of each part with more arrival rate within one cell. Because a queue behind each machine; queuing theory is used to formulate the model. T...
In this paper we investigate the issues of data classification (as one of the branches of data mining science) in form of multi-objective mathematical programming model. The model that we present and investigate is a MODM problem. First time, based on support vector machine (SVM) idea (To maximize the margin of two groups), a multi-criteria mathematical programming model was proposed for data m...
This paper presents a new mathematical model for a production system through a scheduling problem considering a material handling system as an intelligent transportation system by automated guided vehicles (AGVs). The traditional systems cannot respond to the changes and customer’s demands and for this reason, a flexible production system is used. Therefore, for this purpose, automated transpor...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
We describe in this work a number of central problems of machine learning and show how they can be modeled and solved as mathematical programs of various complexity.
The fields of machine learning and mathematical programming are increasingly intertwined. Optimization problems lie at the heart of most machine learning approaches. The Special Topic on Machine Learning and Large Scale Optimization examines this interplay. Machine learning researchers have embraced the advances in mathematical programming allowing new types of models to be pursued. The special...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید