نتایج جستجو برای: sized problem
تعداد نتایج: 922679 فیلتر نتایج به سال:
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
Amitriptyline hydrochloride is a highly permeable active pharmaceutical ingredient (API). The function of these drugs is to block the reuptake of the neurotransmitters, norepinephrine and serotonin in the central nervous system. The nano-sized Amitriptyline (AT) imprinted polymer particles were synthesized successfully. The nanoparticles were characterized by Fourier transform infrared spectros...
Machines are a key element in the production system and their failure causes irreparable effects in terms of cost and time. In this paper, a new multi-objective mathematical model for dynamic cellular manufacturing system (DCMS) is provided with consideration of machine reliability and alternative process routes. In this dynamic model, we attempt to resolve the problem of integrated family (par...
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
Short-lived TCP connections, which transmit small-sized data, suffer from significant low throughput compared with long-lived TCP connections, which transmit large-sized data, because of the inherent nature of the ACK-based window flow control of TCP. In this paper, we focus on the unfairness problem caused by transmitting differently sized data. We first confirm the unfairness property through...
This paper addresses a green capacitated vehicle routing problem that accounts for transportation emissions. A Dynamic Programming approach has been used to formulate the problem. Although small-sized problems can be solved by Programming, this is infeasible larger due curse of dimensionality. Therefore, we propose based solution involves ideas restriction, simulation and online control paramet...
We define the Repeat Offender Problem (ROP). Elsewhere, we have presented the first dynamic-sized, lock-free data structures that can free memory to any standard memory allocator—even after thread failures—without requiring special support from the operating system, the memory allocator, or the hardware. These results depend on a solution to the ROP problem. Here we present the first solution t...
This paper presents a new model of two-echelon periodic supply vessel planning problem with time windows mix of facility location (PSVPTWMFL-2E) in an offshore oil and gas industry. The new mixed-integer nonlinear programming (MINLP) modelconsists ofa fleet composition problem and a location-routing problem (LRP). The aim of the model is to determine the size and type of large vessels in the fi...
This paper studies a location–routing–inventory problem in a multi-period closed-loop supply chain with multiple suppliers, producers, distribution centers, customers, collection centers, recovery, and recycling centers. In this supply chain, centers are multiple levels, a price increase factor is considered for operational costs at centers, inventory and shortage (including lost sales and back...
The Hajj os Calculus is a simple, nondeterministic procedure which generates the class of non-3-colorable graphs. Mansseld and Welsch MW] posed the question of whether there exist graphs which require exponential-sized Hajj os constructions. Unless NP 6 = coNP, there must exist graphs which require exponential-sized constructions, but to date, little progress has been made on this question, des...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید