scholarly journals Load-balancing for multi-skilled servers with Bernoulli routing

2022 ◽  
Author(s):  
Fernando Miguelez ◽  
Josu Doncel ◽  
Balakrishna J. Prabhu
Keyword(s):  
Fixed Point ◽  
Queueing System ◽  
Optimal Solution ◽  
Processor Sharing ◽  
Fixed Point Algorithm ◽  
Multiclass Queueing ◽  
Holding Cost ◽  
The Common ◽  
The Cost ◽  
Theoretical Results

AbstractWe study the optimal Bernoulli routing in a multiclass queueing system with a dedicated server for each class as well as a common (or multi-skilled) server that can serve jobs of all classes. Jobs of each class arrive according to a Poisson process. Each server has a holding cost per customer and use the processor sharing discipline for service. The objective is to minimize the weighted mean holding cost. First, we provide conditions under which classes send their traffic only to their dedicated server, only to the common server, or to both. A fixed point algorithm is given for the computation of the optimal solution. We then specialize to two classes and give explicit expressions for the optimal loads. Finally, we compare the cost of multi-skilled server with that of only dedicated or all common servers. The theoretical results are complemented by numerical examples that illustrate the various structural results as well as the convergence of the fixed point algorithm.

scholarly journals On the Control of Coefficient Function in a Hyperbolic Problem with Dirichlet Conditions

2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Seda İğret Araz ◽  
Murat Subaşi
Keyword(s):  
Lipschitz Continuity ◽  
Optimal Solution ◽  
Adjoint Problem ◽  
Necessary Condition ◽  
Coefficient Function ◽  
Hyperbolic Problem ◽  
Dirichlet Conditions ◽  
Gradient Of The Functional ◽  
The Cost ◽  
Theoretical Results

This paper presents theoretical results about control of the coefficient function in a hyperbolic problem with Dirichlet conditions. The existence and uniqueness of the optimal solution for optimal control problem are proved and adjoint problem is used to obtain gradient of the functional. However, a second adjoint problem is given to calculate the gradient on the space W210,l. After calculating gradient of the cost functional and proving the Lipschitz continuity of the gradient, necessary condition for optimal solution is constructed.

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

Developing the adaptive process-based budgeting through TD-ABC and TD-ABB as part of strategic management accounting

2020 ◽  
Vol 23 (10) ◽  
pp. 1182-1194
Author(s):  
A.A. Akhmetzyanov ◽  
A.Yu. Sokolov
Keyword(s):  
Strategic Management ◽  
Cost Allocation ◽  
Management Accounting ◽  
Practical Significance ◽  
Common Time ◽  
Strategic Management Accounting ◽  
Scientific Papers ◽  
The Subject ◽  
The Common ◽  
The Cost

Subject. The article focuses on the advanced time-driven tools for allocating overhead expenses, which are based on process-based budgeting. Objectives. We articulate a technique for cost allocation so as to assess the cost of each process with reference to the common time driver. Methods. The study relies upon methods of systematization, classification, analogy and comparison, and summarizes the scientific literature on the subject. Results. The article presents our own suggestions on implementing TD-ABC and TD-ABB into the strategic management accounting process of developer companies. The principles were proved to help more effectively allocate overhead expenses and assess the capacity load of each process performed by functions, departments and employees. Carrying out a comparative analysis, we found certain reserves for utilizing resources more effectively. Conclusions and Relevance. The findings are of scientific and practical significance and can be used by developer and construction businesses. The conclusions can prove helpful for scientific papers, student books, and further research.

scholarly journals Inclusion of Hydraulic Controls in Rehabilitation Models of Drainage Networks to Control Floods

Water ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 514
Author(s):  
Leonardo Bayas-Jiménez ◽  
F. Javier Martínez-Solano ◽  
Pedro L. Iglesias-Rey ◽  
Daniel Mora-Melia ◽  
Vicente S. Fuertes-Miquel
Keyword(s):  
Genetic Algorithm ◽  
Drainage System ◽  
Optimal Solution ◽  
Hydraulic Control ◽  
Drainage Systems ◽  
Storm Water Management Model ◽  
Drainage Networks ◽  
Extreme Rain ◽  
Rain Events ◽  
The Cost

A problem for drainage systems managers is the increase in extreme rain events that are increasing in various parts of the world. Their occurrence produces hydraulic overload in the drainage system and consequently floods. Adapting the existing infrastructure to be able to receive extreme rains without generating consequences for cities’ inhabitants has become a necessity. This research shows a new way to improve drainage systems with minimal investment costs, using for this purpose a novel methodology that considers the inclusion of hydraulic control elements in the network, the installation of storm tanks and the replacement of pipes. The presented methodology uses the Storm Water Management Model for the hydraulic analysis of the network and a modified Genetic Algorithm to optimize the network. In this algorithm, called the Pseudo-Genetic Algorithm, the coding of the chromosomes is integral and has been used in previous studies of hydraulic optimization. This work evaluates the cost of the required infrastructure and the damage caused by floods to find the optimal solution. The main conclusion of this study is that the inclusion of hydraulic controls can reduce the cost of network rehabilitation and decrease flood levels.

Coincidence and fixed points for hybrid tangential maps

2010 ◽  
Vol 17 (2) ◽  
pp. 273-285
Author(s):  
Tayyab Kamran ◽  
Quanita Kiran
Keyword(s):  
Fixed Point ◽  
Fixed Points ◽  
Common Property ◽  
Fixed Point Theorems ◽  
Acta Math ◽  
Contractive Condition ◽  
The Common

Abstract In [Int. J. Math. Math. Sci. 2005: 3045–3055] by Liu et al. the common property (E.A) for two pairs of hybrid maps is defined. Recently, O'Regan and Shahzad [Acta Math. Sin. (Engl. Ser.) 23: 1601–1610, 2007] have introduced a very general contractive condition and obtained some fixed point results for hybrid maps. We introduce a new property for pairs of hybrid maps that contains the property (E.A) and obtain some coincidence and fixed point theorems that extend/generalize some results from the above-mentioned papers.

scholarly journals Common fixed point theorem on Proinov type mappings via simulation function

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Badr Alqahtani ◽  
Sara Salem Alzaid ◽  
Andreea Fulga ◽  
Seher Sultan Yeşilkaya
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Common Fixed Point ◽  
Point Theorem ◽  
Simulation Function ◽  
Type Mapping ◽  
The Common ◽  
Common Fixed Point Theorem

AbstractIn this paper, we aim to discuss the common fixed point of Proinov type mapping via simulation function. The presented results not only generalize, but also unify the corresponding results in this direction. We also consider an example to indicate the validity of the obtained results.

scholarly journals Results on the approximate controllability of fractional hemivariational inequalities of order $1< r<2$

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
M. Mohan Raja ◽  
V. Vijayakumar ◽  
Le Nhat Huynh ◽  
R. Udhayakumar ◽  
Kottakkaran Sooppy Nisar
Keyword(s):  
Fixed Point ◽  
Control Systems ◽  
Approximate Controllability ◽  
Hemivariational Inequalities ◽  
Evolution Inclusions ◽  
Fractional Systems ◽  
Cosine Families ◽  
Fixed Point Approach ◽  
Semilinear Control Systems ◽  
Theoretical Results

AbstractIn this paper, we investigate the approximate controllability of fractional evolution inclusions with hemivariational inequalities of order $1< r<2$ 1 < r < 2 . The main results of this paper are verified by using the fractional theories, multivalued analysis, cosine families, and fixed-point approach. At first, we discuss the existence of the mild solution for the class of fractional systems. After that, we establish the approximate controllability of linear and semilinear control systems. Finally, an application is presented to illustrate our theoretical results.

scholarly journals Carbon Emission Reduction of Apparel Material Distribution Based on Multi-Objective Genetic Algorithm (NSGA-II)

2019 ◽  
Vol 11 (9) ◽  
pp. 2571
Author(s):  
Xujing Zhang ◽  
Lichuan Wang ◽  
Yan Chen
Keyword(s):  
Genetic Algorithm ◽  
Carbon Emissions ◽  
Optimal Solution ◽  
Material Distribution ◽  
Low Carbon ◽  
Nsga Ii ◽  
Management Objectives ◽  
Multi Objective Genetic Algorithm ◽  
Distribution Process ◽  
The Cost

Low-carbon production has become one of the top management objectives for every industry. In garment manufacturing, the material distribution process always generates high carbon emissions. In order to reduce carbon emissions and the number of operators to meet enterprises’ requirements to control the cost of production and protect the environment, the paths of material distribution were analyzed to find the optimal solution. In this paper, the model of material distribution to obtain minimum carbon emissions and vehicles (operators) was established to optimize the multi-target management in three different production lines (multi-line, U-shape two-line, and U-shape three-line), while the workstations were organized in three ways: in the order of processes, in the type of machines, and in the components of garment. The NSGA-II algorithm (non-dominated sorting genetic algorithm-II) was applied to obtain the results of this model. The feasibility of the model and algorithm was verified by the practice of men’s shirts manufacture. It could be found that material distribution of multi-line layout produced the least carbon emissions when the machines were arranged in the group of type.

scholarly journals Application Of The Work Breakdown Structure In Determining Cost Buffers In Construction Schedules

2015 ◽  
Vol 61 (1) ◽  
pp. 147-161 ◽  
Author(s):  
M. Połoński
Keyword(s):  
Construction Projects ◽  
Work Breakdown Structure ◽  
Initial Task ◽  
The Common ◽  
Definition Of ◽  
The Cost ◽  
Construction Schedules

AbstractThe paper presents methods of determining the location of cost buffers and corresponding contingency costs in the CPM schedule based on its work breakdown structure. Application of correctly located cost buffers with appropriately established reserve costs is justified by the common overrunning of scheduled costs in construction projects. Interpolated cost buffers (CB) as separate tasks have been combined with relevant summary tasks by the start–to–start (SS) relationship, whereas the time of their execution has been dynamically connected with the time of accomplishment of particular summary tasks using the “paste connection” option. Besides cost buffers linked with the group of tasks assigned to summary tasks, a definition of the cost buffer for the entire project (PCB) has been proposed, i.e. as one initial task of the entire project. Contingency costs corresponding to these buffers, depending on the data that the planner has at his disposal, can be determined using different methods, but always depend on the costs of all tasks protected by each buffer. The paper presents an exemplary schedule for a facility and the method of determining locations and cost for buffers CB and PCB, as well as their influence on the course of the curve illustrating the budgeted cost of work scheduled (BCWS). The proposed solution has been adjusted and presented with consideration of the possibilities created by the scheduling software MS Project, though its general assumptions may be implemented with application of other similar specialist tools.

Sign in / Sign up

Export Citation Format

Share Document