Articoli di riviste sul tema "FCFM policy"
Segui questo link per vedere altri tipi di pubblicazioni sul tema: FCFM policy.
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "FCFM policy".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
1
Grosof, Isaac, Kunhe Yang, Ziv Scully e Mor Harchol-Balter. "Nudge: Stochastically Improving upon FCFS". Proceedings of the ACM on Measurement and Analysis of Computing Systems 5, n. 2 (giugno 2021): 1–29. http://dx.doi.org/10.1145/3460088.
Abstract (sommario):
The First-Come First-Served (FCFS) scheduling policy is the most popular scheduling algorithm used in practice. Furthermore, its usage is theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of response time. But what if we don't just care about the asymptotic tail? What if we also care about the 99th percentile of response time, or the fraction of jobs that complete in under one second? Is FCFS still best? Outside of the asymptotic regime, only loose bounds on the tail of FCFS are known, and optimality is completely open. In this paper, we introduce a new policy, Nudge, which is the first policy to provably stochastically improve upon FCFS. We prove that Nudge simultaneously improves upon FCFS at every point along the tail, for light-tailed job size distributions. As a result, Nudge outperforms FCFS for every moment and every percentile of response time. Moreover, Nudge provides a multiplicative improvement over FCFS in the asymptotic tail. This resolves a long-standing open problem by showing that, counter to previous conjecture, FCFS is not strongly asymptotically optimal.
2
Grosof, Isaac, Kunhe Yang, Ziv Scully e Mor Harchol-Balter. "Nudge: Stochastically Improving upon FCFS". ACM SIGMETRICS Performance Evaluation Review 49, n. 1 (22 giugno 2022): 11–12. http://dx.doi.org/10.1145/3543516.3460102.
Abstract (sommario):
The First-Come First-Served (FCFS) scheduling policy is the most popular scheduling algorithm used in practice. Furthermore, its usage is theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of response time. But what if we don't just care about the asymptotic tail? What if we also care about the 99th percentile of response time, or the fraction of jobs that complete in under one second? Is FCFS still best? Outside of the asymptotic regime, only loose bounds on the tail of FCFS are known, and optimality is completely open. In this paper, we introduce a new policy, Nudge, which is the first policy to provably stochastically improve upon FCFS. We prove that Nudge simultaneously improves upon FCFS at every point along the tail, for light-tailed job size distributions. As a result, Nudge outperforms FCFS for every moment and every percentile of response time. Moreover, Nudge provides a multiplicative improvement over FCFS in the asymptotic tail. This resolves a long-standing open problem by showing that, counter to previous conjecture, FCFS is not strongly asymptotically optimal. This paper represents an abridged version of [2].
3
Elalouf, Amir, Ariel Rosenfeld e Ofir Rockach. "The Extended David-Yechiali Rule for Kidney Allocation". Mathematics 11, n. 2 (8 gennaio 2023): 331. http://dx.doi.org/10.3390/math11020331.
Abstract (sommario):
The First Come First Served (FCFS) queuing policy is routinely assumed to be the benchmark policy for “fairness” in waiting-time performance. In this article, we propose a slight modification of the FCFS policy based on a natural extension of the well-established David and Yechiali (DY) rule and analyze it in the context of managing a waiting list for kidney transplants. In the proposed policy, the queuing agents are sequentially offered a stochastically arriving organ on a “first come, first served” basis while applying the individually optimal DY stopping rule. Through a realistic simulation, we show that the proposed policy, which we term Extended David and Yechiali (EDY), favorably compares to the FCFS policy in terms of medical efficiency while maintaining a comparable level of equity (i.e., fairness). Possible implications and practical aspects of the EDY are discussed.
4
Wu, Yuanyuan, e Feng Zhu. "Junction Management for Connected and Automated Vehicles: Intersection or Roundabout?" Sustainability 13, n. 16 (23 agosto 2021): 9482. http://dx.doi.org/10.3390/su13169482.
Abstract (sommario):
The concept of signal-free management at road junctions is tailored for Connected and Automated Vehicles (CAVs), in which the conventional signal control is replaced by various right-of-way assignment policies. First-Come-First-Served (FCFS) is the most commonly used policy. In most proposed strategies, although the traffic signals are replaced, the organization of vehicle trajectory remains the same as that of traffic lights. As a naturally signal-free strategy, roundabout has not received enough attention. A key motivation of this study is to theoretically compare the performance of signalized intersection (I-Signal), intersection using FCFS policy (I-FCFS), roundabout using the typical major-minor priority pattern (R-MM), and roundabout adopting FCFS policy (R-FCFS) under pure CAVs environment. Queueing theory is applied to derive the theoretical formulas of the capacity and average delay of each strategy. M/G/1 model is used to model the three signal-free strategies, while M/M/1/setup model is used to capture the red-and-green light switch nature of signal control. The critical safety time gaps are the main variables and are assumed to be generally distributed in the theoretical derivation. Analytically, I-Signal has the largest capacity benefiting from the ability to separate conflict points in groups, but in some cases it will have higher delay. Among the other three signal-free strategies, R-FCFS has the highest capacity and the least average control delay, indicating that the optimization of signal-free management of CAVs based on roundabout setting is worthy of further study.
5
Ogunwolu, L., A. Sosimi e S. Obialo. "MODELING, OPTIMISATION AND ANALYSIS OF RE-ENTRANT FLOWSHOP JOB SCHEDULING WITH FUZZY PROCESSING TIMES". Nigerian Journal of Technology 36, n. 3 (30 giugno 2017): 806–13. http://dx.doi.org/10.4314/njt.v36i3.21.
Abstract (sommario):
This paper presents a makespan minimization of -jobs -machines re-entrant flow shop scheduling problem (RFSP) under fuzzy uncertainties using Genetic Algorithm. The RFSP objective is formulated as a mathematical programme constrained by number of jobs and resources availability with traditional scheduling policies of First Come First Serve (FCFS) and the First Buffer First Serve (FBFS). Jobs processing times were specified by fuzzy numbers and modelled using triangular membership function representations. The modified centroid defuzzification technique was used at different alpha-cuts to obtain fuzzy processing times (FPT) of jobs to explore the importance of uncertainty. The traditional GA schemes and operators were used together with roulette wheel algorithm without elitism in the selection process based on job fuzzy completion times. A test problem of five jobs with specified Job Processing and Transit Times between service centres, Job Start Times and Job Due times was posed. Results obtained using the deterministic and fuzzy processing times were compared for the two different scheduling policies, FCFS and FBFS. The deterministic optimal makespan for FBFS schedule was 61.2% in excess of the FCFS policy schedule.  The results also show that schedules with fuzzy uncertainty processing times provides shorter makespans than those for deterministic processing times and those under FCFS performing better than those under FBFS policy for early jobs while on the long run the FBFS policy performs better. The results underscore the need to take account of comprehensive fuzzy uncertainties in job processing times as a trade-off between time and costs influenced by production makespan. http://dx.doi.org/10.4314/njt.v36i3.21
6
Yu, George, e Ziv Scully. "Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1". Proceedings of the ACM on Measurement and Analysis of Computing Systems 8, n. 2 (21 maggio 2024): 1–33. http://dx.doi.org/10.1145/3656011.
Abstract (sommario):
We study the problem of scheduling jobs in a queueing system, specifically an M/G/1 with light-tailed job sizes, to asymptotically optimize the response time tail. This means scheduling to make \mathbfP [T > t], the chance a job's response time exceeds t, decay as quickly as possible in the t \to \infty limit. For some time, the best known policy was First-Come First-Served (FCFS), which has an asymptotically exponential tail: \mathbfP [T > t] \sim C e^-γ t . FCFS achieves the optimal *decay rate* γ, but its *tail constant* C is suboptimal. Only recently have policies that improve upon FCFS's tail constant been discovered. But it is unknown what the optimal tail constant is, let alone what policy might achieve it. In this paper, we derive a closed-form expression for the optimal tail constant C, and we introduce *γ-Boost*, a new policy that achieves this optimal tail constant. Roughly speaking, γ-Boost operates similarly to FCFS, but it pretends that small jobs arrive earlier than their true arrival times. This significantly reduces the response time of small jobs without unduly delaying large jobs, improving upon FCFS's tail constant by up to 50% with only moderate job size variability, with even larger improvements for higher variability. While these results are for systems with full job size information, we also introduce and analyze a version of γ-Boost that works in settings with partial job size information, showing it too achieves significant gains over FCFS. Finally, we show via simulation that γ-Boost has excellent practical performance.
7
Jeong, Ki Yong, e Hyung Jun Park. "A Study on Policy Design to Improve the Acceptance of Game Regulation Policy: Focusing on Fuzzy Cognitive Map(FCM) Policy Scenario Analysis". Korean Policy Studies Review 31, n. 2 (30 giugno 2022): 33–64. http://dx.doi.org/10.33900/kaps.2022.31.2.2.
8
Altman, Eitan, e Hanoch Levy. "Queueing in space". Advances in Applied Probability 26, n. 4 (dicembre 1994): 1095–116. http://dx.doi.org/10.2307/1427906.
Abstract (sommario):
We consider a problem in which a single server must serve a stream of customers whose arrivals are distributed over a finite-size convex space. Under the assumption that the server has full information on the customer location, obvious service policies are the FCFS and the greedy (serve-the-closest-customer) approaches. These algorithms are, however, either inefficient (FCFS) or ‘unfair' (greedy).We propose and study two alternative algorithms, the gated-greedy policy and the gated-scan policy, which are more ‘fair' than the pure greedy method. We show that the stability conditions of the gated-greedy are p < 1 (where p is the expected rate at which work arrives at the system), implying that the method is at least as efficient (in terms of system stability) as any other discipline, in particular the greedy one. For the gated-scan policy we show that for any p < 1 one can design a stable gated-scan policy; however, for any fixed gated-scan policy there exists p < 1 for which the policy is unstable. We evaluate the performance of the gated-scan policy, and present bounds for the performance of the gated-greedy policy.These results are derived for systems in which the arrivals occur on a two-dimensional space (a square) but they are not limited to this configuration; rather they hold for more complex N-dimensional spaces, in particular for serving customers in (three-dimensional) convex space and serving customers on a line.
9
Altman, Eitan, e Hanoch Levy. "Queueing in space". Advances in Applied Probability 26, n. 04 (dicembre 1994): 1095–116. http://dx.doi.org/10.1017/s000186780002677x.
Abstract (sommario):
We consider a problem in which a single server must serve a stream of customers whose arrivals are distributed over a finite-size convex space. Under the assumption that the server has full information on the customer location, obvious service policies are the FCFS and the greedy (serve-the-closest-customer) approaches. These algorithms are, however, either inefficient (FCFS) or ‘unfair' (greedy). We propose and study two alternative algorithms, the gated-greedy policy and the gated-scan policy, which are more ‘fair' than the pure greedy method. We show that the stability conditions of the gated-greedy are p < 1 (where p is the expected rate at which work arrives at the system), implying that the method is at least as efficient (in terms of system stability) as any other discipline, in particular the greedy one. For the gated-scan policy we show that for any p < 1 one can design a stable gated-scan policy; however, for any fixed gated-scan policy there exists p < 1 for which the policy is unstable. We evaluate the performance of the gated-scan policy, and present bounds for the performance of the gated-greedy policy. These results are derived for systems in which the arrivals occur on a two-dimensional space (a square) but they are not limited to this configuration; rather they hold for more complex N-dimensional spaces, in particular for serving customers in (three-dimensional) convex space and serving customers on a line.
10
Liu, Hongyi, e Tianyu He. "Sustainable Management of Land Resources: The Case of China’s Forestry Carbon Sink Mechanism". Land 12, n. 6 (6 giugno 2023): 1188. http://dx.doi.org/10.3390/land12061188.
Abstract (sommario):
Compared to more developed countries, the use of land resources is less efficient in China. China’s vast forest land area gives it a rich and underutilized carbon sink. This is an important way for China to achieve the goals of “carbon peaking” and “carbon neutrality”, which is of great significance to China’s sustainable development. In the past 20 years, China has designed a series of policies to serve the development of forestry carbon sinks, namely the forestry carbon sink mechanism (FCSM). However, the questions of which policy is the most important, and what is the socio-economic value it generates, have not been fully investigated. Accordingly, this paper studied 30 provincial-level regions in China from 2005 to 2020 using the difference-in-differences (DID) model. The conclusions show that: (1) the FCSM does increase the socio-economic value of land resources, thus improving the sustainability of land resources; (2) the FCSM helps to increase forest coverage, forest stock volume and the forest coverage rate, which increases the social value of land resources from the greening path; (3) the FCSM helps to increase the gross forestry product, which increases the economic value of land resources through the path of increasing production value.
11
Jezkova, Veronika, Zuzana Rowland, Veronika Machova e Jan Hejda. "The Intrinsic Value of an Enterprise Determined by Means of the FCFE Tool". Sustainability 12, n. 21 (26 ottobre 2020): 8868. http://dx.doi.org/10.3390/su12218868.
Abstract (sommario):
This paper deals with the determination of the intrinsic value of the company Seznam.cz, a.s. using discounted cash flow. Specifically, it is concerned with determining the value of the business from the perspective of the company’s shareholders. The Free Cash Flow to Equity (FCFE) method is chosen for analysis and determination of the value. According to this method, the specific FCFE values are discovered. However, the enterprise value must also be analyzed on the basis of other key indicators, such as financial leverage, the Capital Asset Pricing Model (CAPM) method, or the net present and future value of the FCFE. This is especially important so that the results can be put into mutual relations and a sufficient representative value of the FCFE results can be achieved. Input values stem from the company’s annual reports. From the results of the mentioned methods and indicators, it was found that the value of the FCFE is quite high, which means that the capital used is used appropriately. Based on the result of the continuing value of the FCFE, it can be said that the company’s intrinsic value is at a very good level.
12
Naz, Insha, Sameena Naaz, Parul Agarwal, Bhavya Alankar, Farheen Siddiqui e Javed Ali. "A Genetic Algorithm-Based Virtual Machine Allocation Policy for Load Balancing Using Actual Asymmetric Workload Traces". Symmetry 15, n. 5 (5 maggio 2023): 1025. http://dx.doi.org/10.3390/sym15051025.
Abstract (sommario):
Load balancing is a very important concept in cloud computing. In this work, studies are conducted on workload traces at Los Alamos National Lab (LANL). The jobs in this trace are asymmetric in nature as most of them have small time limit. Two hybrid algorithms, a Genetic Algorithm combined with First Come First Serve (GA_FCFS) and Genetic Algorithm combined with Round Robin (GA_RR), are proposed here. The results obtained are compared with the existing First Come First Serve (FCFS), Round Robin (RR) and Genetic Algorithm (GA). Makespan and Resource Utilization are used for the comparison of results. In terms of Makespan, it is observed that GA_RR outperforms the other methods for all the batch sizes. Although the performance of GA_FCFS is much better than that of the other three well-established algorithms FCFS, RR and GA, it is still worse than that of the GA_RR algorithm for all the cases. GA_RR performs best in terms of Resource Utilization also and GA_FCFS is a close competitor. Overall, GA_RR outperforms all the other algorithms.
13
Çağlayan, Önder, e Murat Aymelek. "An Integrated Multi-Criteria Decision Support Model for Sustainable Ship Queuing Policy Application via Vessel Traffic Service (VTS)". Sustainability 16, n. 11 (29 maggio 2024): 4615. http://dx.doi.org/10.3390/su16114615.
Abstract (sommario):
The International Maritime Organization (IMO) persistently improves policies to mitigate greenhouse gas (GHG) emissions from maritime operations, emphasizing the significance of operational measures. Simultaneously, heightened recognition of collaborative efforts within the maritime sector has increased the applicability of arrival policies like Just-In-Time Arrival (JITA), aimed at curtailing unnecessary anchorage time and emissions affecting adjacent communities in port vicinities. Nevertheless, ongoing initiatives advocate adopting JITA over the prevailing First Come, First Served (FCFS) policy, which is perceived as inefficient and, in the meantime, fair in the shipping industry. This research introduces an integrated decision support model to facilitate the implementation of a sustainable ship queuing policy by the VTS. The model addresses critical concerns, including the priorities of relevant authorities, the duration of nautical services for incoming vessels, and carbon dioxide (CO2) emissions attributable to anchorage waiting times. The decision support framework presented integrates the Fuzzy Analytical Hierarchy Process (FAHP) and PROMETHEE II methodologies; the study’s outcomes suggest that the model significantly reduces ships’ unnecessary CO2 emissions during anchorage waiting periods compared to the FCFS policy, with reduction rates ranging from 32.8% to 45% based on case analysis. Moreover, the proposed model ensures fairness by treating competing arriving ships equitably according to predefined criteria.
14
O'connell, Neil. "Large deviations for departures from a shared buffer". Journal of Applied Probability 34, n. 3 (settembre 1997): 753–66. http://dx.doi.org/10.2307/3215100.
Abstract (sommario):
In this paper we describe how the joint large deviation properties of traffic streams are altered when the traffic passes through a shared buffer according to a FCFS service policy with stochastic service capacity. We also consider the stationary case, proving large deviation principles for the state of the system in equilibrium and for departures from an equilibrium system.
15
O'connell, Neil. "Large deviations for departures from a shared buffer". Journal of Applied Probability 34, n. 03 (settembre 1997): 753–66. http://dx.doi.org/10.1017/s0021900200101408.
Abstract (sommario):
In this paper we describe how the joint large deviation properties of traffic streams are altered when the traffic passes through a shared buffer according to a FCFS service policy with stochastic service capacity. We also consider the stationary case, proving large deviation principles for the state of the system in equilibrium and for departures from an equilibrium system.
16
Al Duhayyim, Mesfer, Heba G. Mohamed, Jaber S. Alzahrani, Rana Alabdan, Mohamed Mousa, Abu Sarwar Zamani, Ishfaq Yaseen e Mohamed Ibrahim Alsaid. "Modeling of Fuzzy Cognitive Maps with a Metaheuristics-Based Rainfall Prediction System". Sustainability 15, n. 1 (20 dicembre 2022): 25. http://dx.doi.org/10.3390/su15010025.
Abstract (sommario):
Rainfall prediction remains a hot research topic in smart city environments. Precise rainfall prediction in smart cities becomes essential for planning security measures before construction and transportation activities, flight operations, water reservoir systems, and agricultural tasks. Precise rainfall forecasting now becomes more complex than before because of extreme climatic changes. Machine learning (ML) approaches can forecast rainfall by deriving hidden patterns from historic meteorological datasets. Selecting a suitable classification method for forecasting has become a tough job. This article introduces the Fuzzy Cognitive Maps with a Metaheuristics-based Rainfall Prediction System (FCMM-RPS) technique. The intention of the FCMM-RPS technique is to predict rainfall automatically and efficiently. To accomplish this, the presented FCMM-RPS technique primarily pre-processes the rainfall data to make it compatible. In addition, the presented FCMM-RPS technique predicts rainfall using the FCM model. To enhance the rainfall prediction outcomes of the FCM model, the parameter optimization process is performed using a modified butterfly optimization algorithm (MBOA). The performance assessment of the FCMM-RPS technique is tested on a rainfall dataset. A widespread comparison study highlights the improvements of the FCMM-RPS technique in the rainfall forecasting process compared to existing techniques with a maximum accuracy of 94.22%.
17
Khalili, Myriam, Olusegun Famure, Michelle Minkovich, Kathryn J. Tinckam e Sang Joseph Kim. "Selective Elimination and Rationalization of Cell-based Assays in Deceased Donor Kidney Transplant Crossmatching". Transplantation Direct 10, n. 4 (7 marzo 2024): e1603. http://dx.doi.org/10.1097/txd.0000000000001603.
Abstract (sommario):
Background. While there is increasing reliance on a negative virtual crossmatch to proceed with deceased donor kidney transplantation, a flow cytometry crossmatch (FCXM) is still usually performed after the transplant has already occurred. Our center has eliminated pretransplant physical crossmatches for most patients, and since 2018, we have eliminated the systematic performance of posttransplant FCXMs. Methods. We studied all deceased donor kidney transplants in our program between June 1, 2018, and March 31, 2021, to evaluate the impact of eliminating retrospective FCXMs on resource utilization and graft outcomes (ie, the occurrence of antibody-mediated rejection [AMR] in the first 3-mo posttransplant). Results. A total of 358 kidney transplants occurred during the study period, and approximately 70% of these transplants proceeded without the performance of any FCXM. Incidence rates of AMR were low (9.63 per 1000 person-months), which compared favorably with the incidence rate of AMR during the 3-y period preceding the policy (4.82 per 1000 person-months, P = 0.21). Conclusions. Our results suggest that moving away from retrospective FCXM and relying exclusively on the virtual crossmatch is safe and efficient for kidney allocation.
18
Ou, Dongxiu, Huang Yan, Hongming Li e Wei Li. "Optimization of Conflicting Tram Signal Priority Requests Based on Spatiotemporal Interlocking Logic Using Microscopic Simulation". International Journal of Software Engineering and Knowledge Engineering 28, n. 04 (aprile 2018): 507–22. http://dx.doi.org/10.1142/s0218194018400089.
Abstract (sommario):
This paper proposes a method to optimize the conflicting tram signal priority requests at a multi-lines (M-lines) interchange intersection. The method is formulated on the basis of the spatiotemporal logic of complex switch area operations and the characteristics of multiple conflicting tram priority requests. Our study first depicts the interlocking logic of tram system operation according to the phases design and the spatial rules. Furthermore, it classifies the tram priority requests by the intersection entrances, priority phases and tram routes. Finally, it optimizes the serving sequences under the conditions of tram travel delay and switch operation delay. A microscopic traffic simulator, VISSIM, was used to simulate tram system and collect vehicle data. An external application program interface, VISSIM's COM-interface, was used to implement the proposed optimization method. The results show that the proposed method significantly outperforms the no-priority and the conventional first-come-first-served (FCFS) policy in terms of reducing tram delays. More specifically, the average tram delay is reduced by more than 26.6% over the no-priority policy and 13.0% on the FCFS policy in the initial operation. In addition, we find that the average delay which is caused by the switch operation delay increases with the tramline frequency. But the benefits of the proposed method are greater than those of the no-priority strategies.
19
Anton, E., R. Righter e I. M. Verloop. "Scheduling under redundancy". ACM SIGMETRICS Performance Evaluation Review 50, n. 2 (30 agosto 2022): 30–32. http://dx.doi.org/10.1145/3561074.3561085.
Abstract (sommario):
In the present extended abstract we investigate the impact that the scheduling policy has on the performance of redundancy systems when the usual exponentially distributed i.i.d. copies assumption is relaxed. In particular, we investigate the performance, in terms of the total number of jobs in the system, not only for redundancy-oblivious policies, such as FCFS (First-Come-First-Serve) and ROS (Random- Order-of-Service), but also for redundancy-aware policies of the form Π1-?2, where Π1 discriminates among job classes and Π2 discriminates among jobs of the same class. Examples of first-level policies are LRF (Least-Redundant-First) and MRF (Most-Redundant-First), where under LRF, respectively MRF, within a server jobs with fewer copies, respectively more copies, have priority over jobs with more copies, respectively fewer copies. Second-level policies could be FCFS or ROS.
20
Zhang, Qin. "Dynamic Routing Policies for Multi-Skill Call Centers Using Deep Q Network". Mathematics 11, n. 22 (16 novembre 2023): 4662. http://dx.doi.org/10.3390/math11224662.
Abstract (sommario):
When the call center queuing system becomes complex, it turns out that the static routing policy is not optimal. This paper considers the problem of the dynamic routing policy for call centers with multiple skill types and agent groups. A state-dependent routing policy based on the Deep Q Network (DQN) is proposed, and a reinforcement learning algorithm is applied to optimize the routing. A simulation algorithm is designed to help customers and agents interact with the external environment to learn the optimal strategy. The performance evaluation considered in this paper is the service level/abandon rate. Experiments show that the DQN-based dynamic routing policy performs better than the common static policy Global First Come First Serve (FCFS) and the dynamic policy Priorities with Idle Agent Thresholds and Weight-Based Routing in various examples. On the other hand, the training time of the routing policy model based on the DQN is much faster than routing optimization based on simulation and a genetic algorithm.
21
Koole, G. M., B. F. Nielsen e T. B. Nielsen. "OPTIMIZATION OF OVERFLOW POLICIES IN CALL CENTERS". Probability in the Engineering and Informational Sciences 29, n. 3 (24 aprile 2015): 461–71. http://dx.doi.org/10.1017/s0269964815000091.
Abstract (sommario):
We examine how overflow policies in a multi-skill call center should be designed to accommodate performance measures that depend on waiting time percentiles such as service level. This is done using a discrete Markovian approximation of the waiting time of the first customers waiting in line. A Markov decision chain is used to determine the optimal policy. This policy outperforms considerably the ones used most often in practice, which use a fixed threshold. The present method can be used also for other call-center models and other situations where performance is based on actual waiting times and customers are treated in a FCFS order.
22
Mousavi Loghman, Seyyede Ashraf, Alireza Moini e Mir Saman Pishvaee. "A hybrid FCM-VIKOR approach to family economic policy-making". Kybernetes 49, n. 5 (1 agosto 2019): 1485–505. http://dx.doi.org/10.1108/k-02-2019-0078.
Abstract (sommario):
Purpose This paper aims to present a systematic methodology to study different economic labor policies and their impacts on women and families. As women entered into the labor market, the traditional division of family labor vanished. Now, families need to make the best decision to both improve the family economy and enhance family's main functions. In addition, the government is responsible toward the consequences of the family policies. Design/methodology/approach The content analysis, fuzzy cognitive map, scenario-planning and vlse kriterijumsk optimizacija kompromisno resenje (VIKOR) have been combined to deal with the studied problem. As a case study, the focus has been on the Iranian family. According to the developed methodology, different family-oriented policies have been simulated and their results are analyzed. Findings Findings show, considering the effects that the division of the couples’ labor has on meeting the material/non-material family needs, the best policy is to support women's home-based businesses. This way, the economic factors will be improved, the couples’ dependence on meeting their needs will be more favorably affected and the family unity will be strengthened. Originality/value In this study, “family” has been analyzed as a single socioeconomic system. Never have the family economic studies been analyzed with a systematic approach by considering all the economic and non-economic factors together. This objective can be realized by applying the methodology proposed in this research because it can help to predict the consequences of any policy toward the family and provide a platform for proposing better policies and making the related decisions in this area.
23
Salimnejad, Mehrdad, e Nikolaos Pappas. "On the Age of Information in a Two-User Multiple Access Setup". Entropy 24, n. 4 (12 aprile 2022): 542. http://dx.doi.org/10.3390/e24040542.
Abstract (sommario):
This work considers a two-user multiple access channel in which both users have Age of Information (AoI)-oriented traffic with different characteristics. More specifically, the first user has external traffic and cannot control the generation of status updates, and the second user monitors a sensor and transmits status updates to the receiver according to a generate-at-will policy. The receiver is equipped with multiple antennas and the transmitters have single antennas; the channels are subject to Rayleigh fading and path loss. We analyze the average AoI of the first user for a discrete-time first-come-first-served (FCFS) queue, last-come-first-served (LCFS) queue, and queue with packet replacement. We derive the AoI distribution and the average AoI of the second user for a threshold policy. Then, we formulate an optimization problem to minimize the average AoI of the first user for the FCFS and LCFS with preemption queue discipline to maintain the average AoI of the second user below a given level. The constraints of the optimization problem are shown to be convex. It is also shown that the objective function of the problem for the first-come-first-served queue policy is non-convex, and a suboptimal technique is introduced to effectively solve the problem using the algorithms developed for solving a convex optimization problem. Numerical results illustrate the performance of the considered optimization algorithm versus the different parameters of the system. Finally, we discuss how the analytical results of this work can be extended to capture larger setups with more than two users.
24
Xie, Runhan, Isaac Grosof e Ziv Scully. "Heavy-Traffic Optimal Size- and State-Aware Dispatching". Proceedings of the ACM on Measurement and Analysis of Computing Systems 8, n. 1 (16 febbraio 2024): 1–36. http://dx.doi.org/10.1145/3639035.
Abstract (sommario):
Dispatching systems, where arriving jobs are immediately assigned to one of multiple queues, are ubiquitous in computer systems and service systems. A natural and practically relevant model is one in which each queue serves jobs in FCFS (First-Come First-Served) order. We consider the case where the dispatcher is size-aware, meaning it learns the size (i.e. service time) of each job as it arrives; and state-aware, meaning it always knows the amount of work (i.e. total remaining service time) at each queue. While size- and state-aware dispatching to FCFS queues has been extensively studied, little is known about optimal dispatching for the objective of minimizing mean delay. A major obstacle is that no nontrivial lower bound on mean delay is known, even in heavy traffic (i.e. the limit as load approaches capacity). This makes it difficult to prove that any given policy is optimal, or even heavy-traffic optimal. In this work, we propose the first size- and state-aware dispatching policy that provably minimizes mean delay in heavy traffic. Our policy, called CARD (Controlled Asymmetry Reduces Delay), keeps all but one of the queues short, then routes as few jobs as possible to the one long queue. We prove an upper bound on CARD's mean delay, and we prove the first nontrivial lower bound on the mean delay of any size- and state-aware dispatching policy. Both results apply to any number of servers. Our bounds match in heavy traffic, implying CARD's heavy-traffic optimality. In particular, CARD's heavy-traffic performance improves upon that of LWL (Least Work Left), SITA (Size Interval Task Assignment), and other policies from the literature whose heavy-traffic performance is known.
25
Walkowiak, Justyna. "Minority language policy regarding personal names – an overview". Eesti ja soome-ugri keeleteaduse ajakiri. Journal of Estonian and Finno-Ugric Linguistics 2, n. 1 (17 giugno 2011): 367–82. http://dx.doi.org/10.12697/jeful.2011.2.1.24.
Abstract (sommario):
Language Policy (LP) with language planning as its implementation is now a well-established field; yet, as evidenced by the scarcity of scholarly literature, seldom concerned with personal names. The paper looks at personal names (given names and surnames) and discusses the ways in which they can be perceived as objects of minority LP. Policies regarding personal names are analysed within the framework of the traditional division of language planning into status, corpus and acquisition planning. These policies are then further examined according to other dimensions: what the object of a LP is, who its agent is, what motivates a LP, what effects it exerts, and how a LP is carried out. Finally, the paper looks at EU minority legislation with reference to personal names, especially at the country-specific opinions which reflect the FCNM monitoring process, highlighting areas of controversy. In conclusion, it is shown how vital personal names are to personal and group identity and, consequently, how control over them helps the nation-state control a minority, although – it is argued – not every regulation constitutes a minority LP
26
SASAKI, A. "A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring". IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A, n. 6 (1 giugno 2005): 1573–82. http://dx.doi.org/10.1093/ietfec/e88-a.6.1573.
27
Zhang, Qi, Qiuhong Zhao e Yashuai Li. "Integrating Replenishment Policy with GSAA-FCM Based Multi-Criteria Inventory Classification". International Journal of Computational Intelligence Systems 11, n. 1 (2018): 248. http://dx.doi.org/10.2991/ijcis.11.1.19.
28
Sahkhar, Lizia, Bunil Kumar Balabantaray e Satyendra Singh Yadav. "Efficient Cloudlet Allocation to Virtual Machine to Impact Cloud System Performance". International Journal of Information System Modeling and Design 13, n. 6 (novembre 2022): 1–21. http://dx.doi.org/10.4018/ijismd.297630.
Abstract (sommario):
Performance is an essential characteristic of any cloud computing system. It can be enhance through parallel computing, scheduling and load balancing. This work evaluates the connection between the response time (RT) and virtual machine’s (VM) CPU utilization when cloudlets are allocated from the datacenter broker to VM. To accentuate the RT and VM’s CPU utilization, a set of 100 and 500 heterogeneous cloudlets are analyzed under hybridized provisioning, scheduling and allocation algorithm using CloudSim simulator. These includes space shared (SS) and time shared (TS) provisioning policy, shortest job first (SJF), first come first search (FCFS), round robin (RR) and a novel length-wise allocation (LwA) algorithm. The experimental analysis shows that the RT is the least when SJF is combined with RR allocation at 40.665 secs and VM’s CPU utilization is the least when SJF is combined with LwA policy at 12.48 in all combinations of SS and TS provisioning policy.
29
Morgenstern, Craig. "Methods for Precise Submesh Allocation". Scientific Programming 3, n. 4 (1994): 353–64. http://dx.doi.org/10.1155/1994/317328.
Abstract (sommario):
In this article we describe and compare several recently proposed algorithms for precise submesh allocation in a two-dimensional mesh connected system. The methods surveyed include various frame sliding strategies, the maximum boundary value heuristic, and interval set scan techniques. In addition, a new enhancement to the interval set scan method is described. This enhancement results in an algorithm that has better allocation and run-time performance under a FCFS scheduling policy than any of the other proposed methods. We present results drawn from an extensive simulation study to illustrate the relative efficiency of the various methods.
30
Chang, Zheng, Jing Lu e Zhuang Qi. "Location Analysis for Dry Ports Based on FCM". Applied Mechanics and Materials 97-98 (settembre 2011): 1022–26. http://dx.doi.org/10.4028/www.scientific.net/amm.97-98.1022.
Abstract (sommario):
This paper deals with the problem of optimally locating dry ports for seaport. Evaluation system for dry port location decision is established and FCM is applied to solve the problem. The model is used to select optimal location for inland terminals of port Tianjin in China. It is shown that among the direct hinterland of the seaport, Beijing is most suitable for operating dry port, there are also eight inland cities as alternatives. According to the result comparison, industry transfer and relevant policy tendency should also be considered when make the dry port location decision.
31
Baek, Jung Woo. "On the Control Policy of a Queuing–Inventory System with Variable Inventory Replenishment Speed". Mathematics 12, n. 2 (7 gennaio 2024): 194. http://dx.doi.org/10.3390/math12020194.
Abstract (sommario):
This paper considers a make-to-order production–inventory system that comprises a production facility and an inventory warehouse. Customers arrive at the facility to place an order, and the orders are processed using the first-come-first-served (FCFS) discipline. The warehouse supplies inventory items (raw materials) for the production process, and the warehouse inventory is replenished by internal production. The speed of internal production can be controlled through additional costs. If the inventory level drops to zero, the unmet demand waits in the facility until the inventory is replenished. During the stockout period, newly arriving demand is lost. The stationary joint probability of unmet demands and inventory items is derived, and a cost model is constructed. The optimal control policy for internal production is investigated to minimize the cost per unit time of the system. The experimental results show that such a production speed adjustment could reduce costs by up to 42% compared to the cases without the adjustment.
32
Keho, Yaya. "Budget Deficit and Economic Growth in Cote d’Ivoire: A Search for Threshold". Journal of Economics and Public Finance 9, n. 3 (15 agosto 2023): p106. http://dx.doi.org/10.22158/jepf.v9n3p106.
Abstract (sommario):
This study examines the effect of budget deficit on economic growth in Cote d’Ivoire. The study applies threshold regression model to annual data covering the period 1970-2022. The results show that fiscal policy significantly influences economic growth rate. Further, the study establishes that the threshold level of budget deficit conducive for economic growth is 4% of GDP. Beyond this threshold, budget deficit is detrimental to economic growth. As the actual budget deficit is above 4%, the study recommends measures aimed at increasing domestic revenue and enhancing efficiency of public spending to enable the country reap more economic growth associated with fiscal policy. In this regards, efforts should be deployed to reduce tax revenue losses from exemptions and evasion which represent a potential of 4.2% of GDP, i.e. more than FCFA 1800 billion. Under certain assumptions, the “true” budget deficit threshold of Cote d’Ivoire is around 2% of GDP.
33
Akram, Hafiz Wasim, Samreen Akhtar, Alam Ahmad, Imran Anwar e Mohammad Ali Bait Ali Sulaiman. "Developing a Conceptual Framework Model for Effective Perishable Food Cold-Supply-Chain Management Based on Structured Literature Review". Sustainability 15, n. 6 (9 marzo 2023): 4907. http://dx.doi.org/10.3390/su15064907.
Abstract (sommario):
This paper reviews the literature on perishable food cold-chain management (FCCM) in order to assess its current state, pinpoint its knowledge gaps, and suggest a framework for addressing the issues faced by this industry. This work examines 103 academic articles on the topic of the perishable food supply chain published in various journals between 2001 and 2022. Research publications were selected from two reputed databases—Scopus and Web of Science. The study finds that the current trend in FCCM is toward sustainable FCCM, which offers financial, ecological, and social benefits. However, sustainable FCC practices are more common in wealthy nations but are still lacking in developing countries. High lead times, costs, waste, order returns, complaints, and dissatisfied consumers are the results of a fragmented market and the associated proliferation of chain intermediates. The authors have also developed a conceptual framework based on the findings that illustrates the interconnected nature of the food cold-chain facilities, collaboration among food cold-chain (FCC) stakeholders, concern among FCC stakeholders, economic enhancement, fulfilment of FCC stakeholders’ responsibilities, and overall functioning of the FCC. This study may be helpful to FCC professionals, food regulators, government authorities, and researchers because it gives a concise picture of the state of research in the field.
34
Aydin Keskin, Gulsen, e Coskun Ozkan. "Multiple Criteria ABC Analysis with FCM Clustering". Journal of Industrial Engineering 2013 (18 dicembre 2013): 1–7. http://dx.doi.org/10.1155/2013/827274.
Abstract (sommario):
The number of stock keeping units (SKUs) possessed by organizations can easily reach quite a few. An inventory management policy for each individual SKU is not economical to design. ABC analysis is one of the conventionally used approaches to classify SKUs. In the classical method, the SKUs are ranked with respect to the descending order of the annual dollar usage, which is the product of unit price and annual demand. The few of the SKUs that have the highest annual dollar usage are in group A and should be taken into account mostly; the SKUs with the least annual dollar usage are in group C and should be taken into account least; the remaining SKUs are in group B. In this study, we proposed fuzzy c-means (FCM) clustering to a multicriteria ABC analysis problem to help managers to make better decision under fuzzy circumstancse. The obtained results show that the FCM is a quite simple and an easily adaptable method to inventory management.
35
Choi, Bong Dae, Bara Kim e Sung Ho Choi. "An M/G/1 queue with multiple types of feedback, gated vacations and FCFS policy". Computers & Operations Research 30, n. 9 (agosto 2003): 1289–309. http://dx.doi.org/10.1016/s0305-0548(02)00071-0.
36
Etim, Etim Osim, Emmanuel E. Daferighe, Ekwere Raymond Enang e Mary Bassey Nyong. "CASH FLOW MANAGEMENT AND FINANCIAL PERFORMANCE OF SELECTED LISTED COMPANIES IN NIGERIA". INDO-ASIAN JOURNAL OF FINANCE AND ACCOUNTING 3, n. 1 (2022): 27–46. http://dx.doi.org/10.47509/iajfa.2022.v03i01.03.
Abstract (sommario):
This study was aimed at examining the influence of cash flow management on financial performance of selected listed companies in Nigeria. This was premised on the conflicting results and assertions in the literature in respect to the influence of cash flow management and financial performance of entities. Ex-post facto research design was adopted for the study using secondary data of sixty-three (63) selected listed companies in the Nigerian Stock Exchange (NSE) for the period 2013 to 2019. The nature of data was panel data. The dependent variable for financial performance is Return on Asset (ROA), while independent variables was cash flow management decomposed into Operating Cash Flow Margin (OCFM), Operating Cash Flow Ratio (OCFR), Investing Cash Flow Ratio (ICFR), Financing Cash Flow Ratio (FCFR) and Net Cash Flow Ratio (NCFR). The descriptive and inferential statistics were used for data analyses. Results showed that OCFM, OCFR, ICFR and NCFR had positive and significant influence on Financial Performance (ROA) and FCFR had a negative and insignificant influence on financial performance (ROA) of selected listed companies in Nigeria. It was recommended that managers of entities and policy makers, financial consultants and regulatory agencies avail themselves of the core variables of cash flow management used in this study to understand their nexus and to improve in their statutory functions to enhance long-term sustainability of entities.
37
Patra, Prashant Kumar, e Padma Lochan Pradhan. "Dynamic FCFS ACM Model for Risk Assessment on Real Time Unix File System". International Journal of Advanced Pervasive and Ubiquitous Computing 5, n. 4 (ottobre 2013): 41–62. http://dx.doi.org/10.4018/ijapuc.2013100104.
Abstract (sommario):
The access control is a mechanism that a system grants, revoke the right to access the object. The subject and object can able to integrate, synchronize, communicate and optimize through read, write and execute over a UFS. The access control mechanism is the process of mediating each and every request to system resources, application and data maintained by a operating system and determining whether the request should be approve, created, granted or denied as per top management policy. The AC mechanism, management and decision is enforced by implementing regulations established by a security policy. The management has to investigate the basic concepts behind access control design and enforcement, point out different security requirements that may need to be taken into consideration. The authors have to formulate and implement several ACM on normalizing and optimizing them step by step, that have been highlighted in proposed model for development and production purpose. This research paper contributes to the development of an optimization model that aims and objective to determine the optimal cost, time and maximize the quality of services to be invested into security model and mechanisms deciding on the measure components of UFS. This model has to apply to ACM utilities over a Web portal server on object oriented and distributed environment. This ACM will be resolve the uncertainty, un-order, un formal and unset up (U^4) problems of web portal on right time and right place of any where & any time in around the globe. It will be more measurable and accountable for performance, fault tolerance, throughput, bench marking and risk assessment on any application.
38
Li, Jianjun, e Liwei Liu. "On an M/G/1 queue in random environment with Min(N, V) policy". RAIRO - Operations Research 52, n. 1 (gennaio 2018): 61–77. http://dx.doi.org/10.1051/ro/2018006.
Abstract (sommario):
In this paper, we analyze an M∕G∕1 queue operating in multi-phase random environment with Min(N, V) vacation policy. In operative phase i, i = 1, 2, …, n, customers are served according to the discipline of First Come First Served (FCFS). When the system becomes empty, the server takes a vacation under the Min(N, V) policy, causing the system to move to vacation phase 0. At the end of a vacation, if the server finds no customer waiting, another vacation begins. Otherwise, the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n. And whenever the number of the waiting customers in the system reaches N, the server interrupts its vacation immediately and the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n, too. Using the method of supplementary variable, we derive the distribution for the stationary system size at arbitrary epoch. We also obtain mean system size, the results of the cycle analysis and the sojourn time distribution. In addition, some special cases and numerical examples are presented.
39
Vis, P., R. Bekker e R. D. van der Mei. "Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies". Advances in Applied Probability 47, n. 4 (dicembre 2015): 989–1014. http://dx.doi.org/10.1239/aap/1449859797.
Abstract (sommario):
We study cyclic polling models with exhaustive service at each queue under a variety of non-FCFS (first-come-first-served) local service orders, namely last-come-first-served with and without preemption, random-order-of-service, processor sharing, the multi-class priority scheduling with and without preemption, shortest-job-first, and the shortest remaining processing time policy. For each of these policies, we first express the waiting-time distributions in terms of intervisit-time distributions. Next, we use these expressions to derive the asymptotic waiting-time distributions under heavy-traffic assumptions, i.e. when the system tends to saturate. The results show that in all cases the asymptotic waiting-time distribution at queue i is fully characterized and of the form Γ Θi, with Γ and Θi independent, and where Γ is gamma distributed with known parameters (and the same for all scheduling policies). We derive the distribution of the random variable Θi which explicitly expresses the impact of the local service order on the asymptotic waiting-time distribution. The results provide new fundamental insight into the impact of the local scheduling policy on the performance of a general class of polling models. The asymptotic results suggest simple closed-form approximations for the complete waiting-time distributions for stable systems with arbitrary load values.
40
Vis, P., R. Bekker e R. D. van der Mei. "Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies". Advances in Applied Probability 47, n. 04 (dicembre 2015): 989–1014. http://dx.doi.org/10.1017/s0001867800048989.
Abstract (sommario):
We study cyclic polling models with exhaustive service at each queue under a variety of non-FCFS (first-come-first-served) local service orders, namely last-come-first-served with and without preemption, random-order-of-service, processor sharing, the multi-class priority scheduling with and without preemption, shortest-job-first, and the shortest remaining processing time policy. For each of these policies, we first express the waiting-time distributions in terms of intervisit-time distributions. Next, we use these expressions to derive the asymptotic waiting-time distributions under heavy-traffic assumptions, i.e. when the system tends to saturate. The results show that in all cases the asymptotic waiting-time distribution at queueiis fully characterized and of the form Γ Θi, with Γ and Θiindependent, and where Γ is gamma distributed with known parameters (and the same for all scheduling policies). We derive the distribution of the random variable Θiwhich explicitly expresses the impact of the local service order on the asymptotic waiting-time distribution. The results provide new fundamental insight into the impact of the local scheduling policy on the performance of a general class of polling models. The asymptotic results suggest simple closed-form approximations for the complete waiting-time distributions for stable systems with arbitrary load values.
41
Konovalov, Mikhail, e Rostislav Razumchik. "Iterative Algorithm for Threshold Calculation in the Problem of Routing Fixed Size Jobs to Two Parallel Servers". Journal of Telecommunications and Information Technology, n. 3 (30 settembre 2015): 32–38. http://dx.doi.org/10.26636/jtit.2015.3.965.
Abstract (sommario):
At present, solutions of many practical problems require significant computational resources and systems (grids, clouds, clusters etc.), which provide appropriate means are constantly evolving. The capability of the systems to fulfil quality of service requirements pose new challenges for the developers. One of the well-known approaches to increase system performance is the use of optimal scheduling (dispatching) policies. In this paper the special case of the general problem of finding optimal allocation policy in the heterogeneous n-server system processing fixed size jobs is considered. There are two servers working independently at constant but different speeds. Each of them has a dedicated queue (of infinite capacity) in front of it. Jobs of equal size arrive at the system. Inter-arrival times are i.i.d. random variables with general distribution with finite mean. Each job upon arrival must be immediately dispatched to one of the two queues wherefrom it will be served in FCFS manner (no pre-emption). The objective is the minimization of mean job sojourn time in the system. It is known that under this objective the optimal policy is of threshold type. The authors propose scalable fast iterative non-simulation algorithm for approximate calculation of the policy parameter (threshold). Numerical results are given.
42
PATOWARY, A. N., J. HAZARIKA e G. L. SRIWASTAV. "A STANDBY SYSTEM UNDER INTERFERENCE MODELS WITH ONE AND MORE REPAIR FACILITIES". International Journal of Reliability, Quality and Safety Engineering 20, n. 02 (aprile 2013): 1350006. http://dx.doi.org/10.1142/s021853931350006x.
Abstract (sommario):
Here we have considered an n-standby system with one and more than one repair facility (ies) for interference (or stress–strength) models. The system is working under impacts of stresses. Each impact is called a cycle. When a component fails it goes for repair; the repair policy is first-come-first-serve (FCFS). The failure times of components, system and repair times all are measured in cycles. The reliability of the system at the Nth cycle is evaluated in different cases. When stress–strength distributions both are either exponential or gamma or normal the reliability of the system is numerically evaluated for given n, N and for some particular values of the parameters involved and are tabulated. The numerical values of the system reliability are on the expected line.
43
Gast, Nicolas, e Benny Van Houdt. "Approximations to Study the Impact of the Service Discipline in Systems with Redundancy". Proceedings of the ACM on Measurement and Analysis of Computing Systems 8, n. 1 (16 febbraio 2024): 1–33. http://dx.doi.org/10.1145/3639040.
Abstract (sommario):
As job redundancy has been recognized as an effective means to improve performance of large-scale computer systems, queueing systems with redundancy have been studied by various authors. Existing results include methods to compute the queue length distribution and response time but only when the service discipline is First-Come-First-Served (FCFS). For other service disciplines, such as Processor Sharing (PS), or Last-Come-First-Served (LCFS), only the stability conditions are known. In this paper we develop the first methods to approximate the queue length distribution in a queueing system with redundancy under various service disciplines. We focus on a system with exponential job sizes, i.i.d. copies, and a large number of servers. We first derive a mean field approximation that is independent of the scheduling policy. In order to study the impact of service discipline, we then derive refinements of this approximation to specific scheduling policies. In the case of Processor Sharing, we provide a pair and a triplet approximation. The pair approximation can be regarded as a refinement of the classic mean field approximation and takes the service discipline into account, while the triplet approximation further refines the pair approximation. We also develop a pair approximation for three other service disciplines: First-Come-First-Served, Limited Processor Sharing and Last-Come-First-Served. We present numerical evidence that shows that all the approximations presented in the paper are highly accurate, but that none of them are asymptotically exact (as the number of servers goes to infinity). This makes these approximations suitable to study the impact of the service discipline on the queue length distribution. Our results show that FCFS yields the shortest queue length, and that the differences are more substantial at higher loads.
44
윤우섭 e 김각규. "A study on Throughput models of a carouselpod in the military AS/RS - Aqueueing model approach with a cyclic picking policy and a FCFS picking policy". Korean Journal of Military Art and Science 66, n. 2 (agosto 2010): 19–54. http://dx.doi.org/10.31066/kjmas.2010.66.2.002.
45
Aida Dia, Aissata, Karim Dagno e Halimatou Timbine. "SITUATION AND CONDITIONS OF ACCESSIBILITY OF POOR ELDERLY PEOPLE TO HEALTH CARE AND BASIC SOCIAL SERVICES IN MALI". International Journal of Agriculture, Environment and Bioresearch 08, n. 06 (2023): 45–61. http://dx.doi.org/10.35410/ijaeb.2023.5866.
Abstract (sommario):
The care of the elderly in need is a topical issue today. As a result of the consequences of scientific progress, Most of the elderly are destitute seems to be facing difficulties in accessing basic needs. This study, whose main objective is to contribute to the implementation and application of support policies for the elderly in need, took place in the first five regions of Mali and in the District of Bamako. It involved 1200 destitute elderly people and heads of certain institutions in charge of managing support for the elderly. The results obtained showed that 3% of respondents said they could not take care of themselves, 83% were not affiliated with social networks, 98% said they needed help on a daily basis, 73% had an annual income of less than 200,000 FCFA and finally 71% said they were unaware of the existence of the priority card. This study highlighted the lack of social protection for the elderly in need and calls for more policy interventions
46
Siddesh, G. M., e K. G. Srinisas. "An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems". International Journal of Distributed Systems and Technologies 3, n. 4 (ottobre 2012): 63–79. http://dx.doi.org/10.4018/jdst.2012100106.
Abstract (sommario):
Grid Computing provides sharing of geographically distributed resources among large scale complex applications. Due to dynamic nature of resources in grid, there is a need of highly efficient job scheduling and resource management policies in grid. A novel Grid Resource Scheduler (GRS) is proposed to effectively utilize the available resources in Grid. Proposed GRS contributes, an optimal job scheduling algorithm on Job Rank-Backfilling policy and a resource matching algorithm based on ranking of resources with best fit allocation model. Performance of GRS is measured by considering a web based BLAST algorithm – a bioinformatics application. GRS aims in reducing; Makespan of the job workflow, execution time of varied size jobs, response time of the submitted jobs and overhead of using the system. It also considers improving the utilization factor and throughput of the available heterogeneous resources in grid. The experimental results prove that proposed grid scheduler framework performs better when evaluated against widely used First Come First Serve (FCFS), Shortest Job First (SJF) and Minimum Time to Due Date (MTTD) scheduling strategies.
47
Yilmaz, Huseyin. "Capital Structure Function of Cash Flow Based Corporate Finance (CFCF) Model". American Journal of Finance 9, n. 1 (23 gennaio 2024): 1–14. http://dx.doi.org/10.47672/ajf.1744.
Abstract (sommario):
Purpose: The purpose of this article is to explain the capital structure function of CFCF model explaining by Yilmaz (2022) and Yilmaz (2023).
Materials and Methods: First, the 11 cash flow ratios were selected from CFCF model (Yilmaz, 2023). (Look at Yilmaz 2003 for all 30 ratios and their groups). Then, these ratios were explained from the point of view of capital structure function of the FCFC model. Then, they were applied on the Apple Corp. financial statements. Their calculations and comments were fulfilled by the writer.
Findings: This is a theoretical model. As a finding, the 11 ratios could be calculated by the writer. Accordingly, the cash flow ratios of the Apple Corp. shows that its capital structure is managed well and the company does not have any cash flow based capital structure management issue.
Implications to Theory, Practice and Policy: All companies could use this tool, capital structure function of cash flow based corporate finance (CFCF) model to learn capital structure issues and to solve them.
48
Ghafour, Karzan, Razamin Ramli e Nerda Z. Zaibidi. "Developing a M/G/C-FCFS queueing model with continuous review (R, Q) inventory system policy in a cement industry". Journal of Intelligent & Fuzzy Systems 32, n. 6 (23 maggio 2017): 4059–68. http://dx.doi.org/10.3233/jifs-152509.
49
Das, Sudipta, Lawrence Jenkins e Debasis Sengupta. "Analysis of an $$M/M/1+G$$ M / M / 1 + G queue operated under the FCFS policy with exact admission control". Queueing Systems 75, n. 2-4 (14 giugno 2013): 169–88. http://dx.doi.org/10.1007/s11134-013-9366-6.
50
Zongo, Bétéo, Bruno Barbier, Thomas Dogot, Abdoulaye Diarra, Malicki Zorom, Calvin Atewamba, Omer S. Combary et al. "ECONOMIC ANALYSIS AND FOOD SECURITY CONTRIBUTION OF SUPPLEMENTAL IRRIGATION AND FARM PONDS: EVIDENCE FROM NORTHERN BURKINA FASO". Agricultural Social Economic Journal 22, n. 1 (31 gennaio 2022): 59–75. http://dx.doi.org/10.21776/ub.agrise.2022.022.1.9.
Abstract (sommario):
The dry spells are severe obstacles to rainfed agriculture in Sahelian countries. The farmers believe supplemental irrigation is an excellent way to adapt rainfed agriculture to dry spells. In this study, we analyzed the contribution of supplemental irrigation to food security and compared the profitability of different types of ponds constructed by farmers in northern Burkina Faso. Human cereal requirement was used as indicators to analyze the contribution of supplemental irrigation to food security. The criteria for analyzing the profitability of the selected ponds were gross margin (GM), net present value (NPV), internal rate of return (IRR) and payback period (PBP). The results show that the additional yield of corn obtained with supplemental irrigation makes it possible to meet the monthly cereal needs of at least 17 people and generates an additional GM of FCFA 178,483 (US$ 309.26) compared to no irrigation. The estimate of the NPV, from IRR and PBP showed that the profitability of supplemental irrigation in 15 agricultural seasons varies between type of ponds constructed. Given the up-front cost and the farmers’ lack of resources, the ponds require a subsidy or a credit policy to facilitate the adoption of supplemental irrigation in Sahelian countries.