Academic literature on the topic 'Linear Waiting Costs'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Linear Waiting Costs.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Linear Waiting Costs"
1
Desaulniers, Guy, and Daniel Villeneuve. "The Shortest Path Problem with Time Windows and Linear Waiting Costs." Transportation Science 34, no. 3 (August 2000): 312–19. http://dx.doi.org/10.1287/trsc.34.3.312.12298.
Full text
2
Wang, Donghai, Menghao Xi, and Yingzhen Chen. "A Dynamic Shelter Location and Victim Resettlement Model Considering Equitable Waiting Costs." International Journal of Environmental Research and Public Health 17, no. 2 (January 10, 2020): 471. http://dx.doi.org/10.3390/ijerph17020471.
Full textAbstract:
Catastrophic natural disasters cause devastating damage and leave a huge number of homeless people. Waiting for resettlement in a post-disaster environment brings human suffering, which is defined by waiting cost in this paper. Taking into account waiting cost and fairness consideration simultaneously, a mixed integer linear programming model is constructed for the multiperiod location-allocation process. Two fairness indicators are incorporated to guarantee both the whole-process equity and the periodic equity. The model is implemented in the General Algebraic Modeling System (GAMS) and solved by the CPLEX solver. An illustrative example is provided to explain the model characteristics. Furthermore, a case study of the Yushu earthquake is conducted to demonstrate the applicability of the model to practical problems.
3
RODRÍGUEZ, Santiago, Fabio Da MOTTA, Giacomo BALBINOTO NETO, and Ajacio BRANDÃO. "EVALUATION AND SELECTION OF CANDIDATES FOR LIVER TRANSPLANTATION: AN ECONOMIC PERSPECTIVE." Arquivos de Gastroenterologia 57, no. 1 (February 2020): 31–38. http://dx.doi.org/10.1590/s0004-2803.202000000-07.
Full textAbstract:
ABSTRACT BACKGROUND: Over the next 20 years, the number of patients on the waiting list for liver transplantation (LTx) is expected to increase by 23%, while pre-LTx costs should raise by 83%. OBJECTIVE: To evaluate direct medical costs of the pre-LTx period from the perspective of a tertiary care center. METHODS: The study included 104 adult patients wait-listed for deceased donor LTx between October 2012 and May 2016 whose treatment was fully provided at the study transplant center. Clinical and economic data were obtained from electronic medical records and from a hospital management software. Outcomes of interest and costs of patients on the waiting list were compared through the Kruskal-Wallis test. A generalized linear model with logit link function was used for multivariate analysis. P-values <0.05 were considered statistically significant. RESULTS: The costs of patients who underwent LTx ($8,879.83; 95% CI 6,735.24-11,707.27; P<0.001) or who died while waiting ($6,464.73; 95% CI 3,845.75-10,867.28; P=0.04) were higher than those of patients who were excluded from the list for any reason except death ($4,647.78; 95% CI 2,469.35-8,748.04; P=0.254) or those who remained on the waiting list at the end of follow-up. CONCLUSION: Although protocols of inclusion on the waiting list vary among transplant centers, similar approaches exist and common problems should be addressed. The results of this study may help centers with similar socioeconomic realities adjust their transplant policies.
4
Yu, Kai, and Jingcheng Yang. "MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal." Mathematical Problems in Engineering 2019 (January 8, 2019): 1–16. http://dx.doi.org/10.1155/2019/4739376.
Full textAbstract:
This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges for the yard crane scheduling. To formulate this problem, we propose a mixed integer linear programming (MILP) model, which jointly optimizes trucks’ waiting costs and penalty costs caused by exceeding waiting time thresholds. Considering the NP-completeness of this scheduling problem, we develop an efficient rolling horizon algorithm based on some heuristics to reduce the computation time. Finally, computational studies are carried out to evaluate the performance of our method and the solutions obtained by CPLEX solver are used for benchmarking purposes.
5
Argon, Nilay Tanik, Li Ding, Kevin D. Glazebrook, and Serhan Ziya. "DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM." Probability in the Engineering and Informational Sciences 23, no. 2 (February 16, 2009): 175–203. http://dx.doi.org/10.1017/s0269964809000138.
Full textAbstract:
We consider a network of parallel service stations each modeled as a single-server queue. Each station serves its own dedicated customers as well as generic customers who are routed from a central controller. We suppose that the cost incurred by a customer is an increasing function of her time spent in the system. In a significant advance on most previous work, we do not require waiting costs to be convex, still less linear. With the objective of minimizing the long-run average waiting cost, we develop two heuristic routing policies, one of which is based on dynamic programming policy improvement and the other on Lagrangian relaxation. In developing the latter policy, we show that each station is “indexable” under mild conditions for customers’ waiting costs and also prove some structural results on the admission control problem that naturally arises as a result of the Lagrangian relaxation. We then test the performance of our heuristics in an extensive numerical study and show that the Lagrangian heuristic demonstrates a strong level of performance in a range of traffic conditions. In particular, it clearly outperforms both a greedy heuristic, which is a standard proposal in complex routing problems, and a recent proposal from the heavy traffic literature.
6
Haviv, Moshe, and Jan van der Wal. "Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities." Probability in the Engineering and Informational Sciences 11, no. 4 (October 1997): 403–12. http://dx.doi.org/10.1017/s0269964800004940.
Full textAbstract:
We consider a memoryless single-server queue in which users can purchase relative priority so as to reduce their expected waiting costs, which are linear with time. Relative priority is given in proportion to a price paid by customers present in the system. For two service disciplines, (weighted) processor sharing and (weighted) random entrance, we find the unique pure and symmetric Nash equilibrium price paid by the customers.
7
Adan, I. J. B. F., V. G. Kulkarni, N. Lee, and E. Lefeber. "Optimal routeing in two-queue polling systems." Journal of Applied Probability 55, no. 3 (September 2018): 944–67. http://dx.doi.org/10.1017/jpr.2018.59.
Full textAbstract:
Abstract We consider a polling system with two queues, exhaustive service, no switchover times, and exponential service times with rate µ in each queue. The waiting cost depends on the position of the queue relative to the server: it costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where there is no server). Customers arrive according to a Poisson process with rate λ. We study the control problem of how arrivals should be routed to the two queues in order to minimize the expected waiting costs and characterize individually and socially optimal routeing policies under three scenarios of available information at decision epochs: no, partial, and complete information. In the complete information case, we develop a new iterative algorithm to determine individually optimal policies (which are symmetric Nash equilibria), and show that such policies can be described by a switching curve. We use Markov decision processes to compute the socially optimal policies. We observe numerically that the socially optimal policy is well approximated by a linear switching curve. We prove that the control policy described by this linear switching curve is indeed optimal for the fluid version of the two-queue polling system.
8
Shi, Xiaowei, Zhiwei Chen, Mingyang Pei, and Xiaopeng Li. "Variable-Capacity Operations with Modular Transits for Shared-Use Corridors." Transportation Research Record: Journal of the Transportation Research Board 2674, no. 9 (July 30, 2020): 230–44. http://dx.doi.org/10.1177/0361198120928077.
Full textAbstract:
Since passenger demand in urban transit systems is asymmetrically distributed across different periods in a day and different geographic locations across the cities, the tradeoff between vehicle operating costs and service quality has been a persistent problem in transit operational design. The emerging modular vehicle technology offers us a new perspective to solve this problem. Based on this concept, we propose a variable-capacity operation approach with modular transits for shared-use corridors, in which both dispatch headway and vehicle capacity are decision variables. This problem is rigorously formulated as a mixed integer linear programming model that aims to minimize the overall system cost, including passenger waiting time costs and vehicle operating costs. Because the proposed model is linear, the state-of-the-art commercial solvers (e.g., Gurobi) can be used to obtain the optimal solution of the investigated problem. With numerical experiments, we demonstrate the feasibility of the mathematical model, verify the effectiveness of the proposed model in reducing overall system costs in transit systems, as well as the robustness of the proposed model with different parameter settings.
9
Afifudin, M. Thezar, and Dian P. Sahar. "MODEL OPTIMISASI UNTUK MASALAH MINIMISASI BIAYA PERJALANAN WISATA TUR-TUNGGAL DI ZONA KEPULAUAN." ALE Proceeding 4 (August 17, 2021): 68–75. http://dx.doi.org/10.30598/ale.4.2021.68-75.
Full textAbstract:
This study aims to develop an optimization model for solving the insular cost minimization single-tour travel problems. The model was developed using an integer non-linear programming approach by considering the selection of departure and arrival points of an island, selecting accommodation points, selecting transportation mode departure schedules, and selecting travel routes both within islands and between islands. The cost components considered include inter-island travel costs, land travel costs, costs at selective points, and costs waiting for departure. A numerical experiment was conducted on the case of planning a tourist route in Maluku, Indonesia. The departure day scenario is built to find out the exact route and schedule on each day of departure with a minimum total cost. In addition, comparisons were also made to the results obtained in the time minimization model that was introduced earlier. The results showed that the model can adapt through variations of solutions to changes in the given parameters and objectives.
10
Rieder, Ulrich, and Jürgen Weishaupt. "Customer Scheduling with Incomplete Information." Probability in the Engineering and Informational Sciences 9, no. 2 (April 1995): 269–84. http://dx.doi.org/10.1017/s0269964800003855.
Full textAbstract:
A stochastic scheduling model with linear waiting costs and unknown routing probabilities is considered. Using a Bayesian approach and methods of Bayesian dynamic programming, we investigate the finite-horizon stochastic scheduling problem with incomplete information. In particular, we study an equivalent nonstationary bandit model and show the monotonicity of the total expected reward and of the Gittins index. We derive the monotonicity and well-known structural properties of the (greatest) maximizers, the so-called stay-on-a-winnerproperty and the stopping-property. The monotonicity results are based on a special partial ordering on .
Book chapters on the topic "Linear Waiting Costs"
1
Cui, Shiliang, Zhongbin Wang, and Luyi Yang. "Queue Scalping." In Innovative Priority Mechanisms in Service Operations, 55–74. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-30841-3_4.
Full textAbstract:
AbstractIn addition to line-sitting, queue-scalping is also widely witnessed in congestion-prone service systems. Unlike true customers, queue-scalpers have no interest in the service being offered and enter the queue with the pure intent to sell their spots. Different from the line-sitting whereby customers pay someone to stand in line on their behalf (Chap. 3), queue-scalping takes a make-to-stock (MTS) approach in that queue-scalpers perpetually circulate in the queue before the arrival of a client, so by the time a buying customer arrives, she can readily take a scalper’s spot and shorten her wait. Thus, its value proposition is waiting-time reduction. In contrast, line-sitting takes a make-to-order (MTO) approach in that a line-sitter joins the queue only after a client requests so, and therefore (unlike queue-scalping), line-sitting does not decrease clients’ wait time but alleviates their waiting costs by diverting them from an on-site queue to an off-site queue. We present a queue scalping model in this chapter. This chapter is based on Yang et al. (Manag Sci 67:6803–6821, 2021) and Wang and Wang (Oper Res Lett 49:485–491, 2021) where interested readers can find proofs of the findings shown in this chapter.
2
Cui, Shiliang, Zhongbin Wang, and Luyi Yang. "Distance-Based Service Priority." In Innovative Priority Mechanisms in Service Operations, 99–118. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-30841-3_6.
Full textAbstract:
AbstractObtaining a service usually comes with both rewards and costs. For example, dining at a popular restaurant provides customers with a pleasant dining experience, but also incurs costs to them. The costs include the direct service charge that customers have to pay to receive the service (the meal cost) and indirect hassle costs such as going to the restaurant and waiting in line for the service. When the service reward is too low or the service fee is too high, customers will be less likely interested in the service. The same happens when the hassle cost of seeking service is too high, which is especially true when customers must travel a long distance to obtain a service that tends to have cumbersome wait times. It is without question that increasing the number of customers being served (i.e. system throughput) is critical for service providers, as it translates directly into service revenue in the case of a for-profit company and service provision in the case of a non-profit organization. Therefore, how may service providers incentivize customers located far away from the service location to seek service? In this chapter, we introduce an innovative but natural distance-based service priority mechanism to help service providers increase their system throughput. The idea is to assign higher service priority to customers who have to travel farther for the service, thus giving them with new incentives to consider using the service. We shall demonstrate, among other results, that such a mechanism can significantly increase system throughput by attracting more customers to use the service, and the increase can be up to 50% compared to the ordinary first-come-first-served service discipline. This chapter is primarily based on Wang et al. (Manuf Serv Oper Manag, 25(1), 353–369, 2023) where interested readers can find proofs of the findings shown in this chapter.
3
Wong, Jane. "Snow, Rain, Heat, Pandemic, Gloom of Night." In What Things Cost, 256–59. University Press of Kentucky, 2023. http://dx.doi.org/10.5810/kentucky/9780813182438.003.0112.
Full textAbstract:
The post office doesn’t have clocks. Waiting in line, I can feel everyone’s tension and anger stewing, leaking out of their pores like gasoline. The air fills with the soup of impatience. There are five people ahead of me. I take it all in: the tapping of a high-heeled shoe, the exaggerated checking of a watch, the shifting of packages from one arm to the other. The line moves and a woman steps up to the counter with her face mask on wrong. It flops down below her nose like loose pantyhose. She keeps touching her mask. Not to adjust it to the correct position, just to touch it. Then she slams her pocketbook down on the counter like she’s crushing a cockroach and shouts at the clerk: “Do you know how long I’ve been waiting in this fucking line?”...
4
Gao, Qiqi, Baohua Mao, Min Wang, Qi Zhou, and Yi Ge. "Analysis on Operation Mode of Y-Type Rail Transit in Suburbs." In Advances in Transdisciplinary Engineering. IOS Press, 2022. http://dx.doi.org/10.3233/atde220004.
Full textAbstract:
The construction of a Y-type urban rail transit line can effectively solve the problems of low line coverage and low utilization in suburban areas. The purpose of this paper is to study and analyze the effect of different operation modes of the Y-type line of suburban urban rail transit. In this paper, the objective function is to minimize value of passenger travel time costs and enterprise operating costs, and the main and branch train frequencies are used as decision variables to establish a selection model for Y-type operation mode, and design an improved multi-objective optimization algorithm based on NSGA-II. A case study was carried out on the Y-type line to evaluate the effect of each scheme. The results of the study found that there is no obvious difference between the advantages and disadvantages of the three operation modes. The passenger waiting time under the independent operation plan is the highest but the comfort level is greater, and the train travel distance is the lowest. The partial- through operation accommodates the interests of both passenger and business. Therefore, the corresponding operating mode should be selected according to the preferences of passengers and enterprises.
5
Jebbor, Ikhlef, Zoubida Benmamoun, Hanaa Hachimi, Youssef Raouf, Mehdi Haqqi, and Mehdi Akikiz. "Improvement of an Assembly Line in the Automotive Industry: A Case Study in Wiring Harness Assembly Line." In Advances in Transdisciplinary Engineering. IOS Press, 2023. http://dx.doi.org/10.3233/atde230031.
Full textAbstract:
Today industrial companies are subject to major and profound changes. It is constantly confronted with a world of ruthless competition that continually aims to improve quality, cost, and lead time. Each company works to satisfy the requirements of its customers and to do this, it continually improves its performance and controls its manufacturing processes from the reception of raw materials from the suppliers to the shipment of the final product to the customer. In this paper, the study focuses on the assembly area of an electrical wiring harness production line and adopts a Lean Manufacturing approach to reduce the time waste and improve the efficiency of this line of engine wiring harness using Line balancing and the work allowed an eliminate of Waiting Muda and increase the efficiency.
6
Huang, Ailing, Yijing Miao, and Jiarui Li. "Optimization of Transit Scheduling Combined with Short-Turn Service Based on Real-Time Passenger Flow." In Fuzzy Systems and Data Mining VI. IOS Press, 2020. http://dx.doi.org/10.3233/faia200752.
Full textAbstract:
In view of a series of problems, such as unable to meet the needs of passengers, high full load ratio or waste of carrying capacity on unbalanced passenger flow sections caused by the all-stop fleet scheduling in the urban public transit system, this paper proposed a bus combination scheduling strategy with considering short-turn service based on the imbalance coefficient of passenger flow and a method to determine the turning back point. A combined dispatching optimization model is established with the objective function of minimizing the total system cost which includes the waiting time cost of passengers, the congestion feeling cost and the operation cost of public transit enterprises. The headways of short-turn and all-stop scheme are optimized by the combined scheduling model, and the solution method is proposed. Taking Beijing No. A bus line as an empirical analysis object, the real-time passenger flow and vehicle data in a working day are collected and analyzed, and the optimized scheme of short-turn service combination scheduling is obtained. The results show that compared with the traditional all-stop fleet scheduling, the optimized short-turn service combination scheduling can reduce the fleet size by 4.9% and effectively improve the operation efficiency and system benefits.
7
Becker, Shirley Ann. "PDA Usability for Telemedicine Support." In Encyclopedia of Human Computer Interaction, 457–62. IGI Global, 2006. http://dx.doi.org/10.4018/978-1-59140-562-7.ch069.
Full textAbstract:
Telemedicine is broadly defined as the use of information and communications technology to provide medical information and services (Perednia & Allen, 1995). Telemedicine offers an unprecedented means of bringing healthcare to anyone regardless of geographic remoteness. It promotes the use of ICT for healthcare when physical distance separates the provider from the patient (Institute of Medicine, 1996). In addition, it provides for real-time feedback, thus eliminating the waiting time associated with a traditional healthcare visit. Telemedicine has been pursued for over three decades as researchers, healthcare providers, and clinicians search for a way to reach patients living in remote and isolated areas (Norris, 2001). Early implementation of telemedicine made use of the telephone in order for healthcare providers and patients to interact. Over time, fax machines were introduced along with interactive multimedia, thus supporting teleconferencing among participants. Unfortunately, many of the early telemedicine projects did not survive because of high costs and insurmountable barriers associated with the use of technology. Telemedicine has been resurrected during the last decade as a means to help rural healthcare facilities. Advances in information and communications technology have initiated partnerships between rural healthcare facilities and larger ones. The Internet in particular has changed the way in which medical consultations can be provided (Coiera, 1997). Personal computers (PCs) and supporting peripherals, acting as clients, can be linked to medical databases residing virtually in any geographic space. Multimedia data types, video, audio, text, imaging, and graphics promote the rapid diagnosis and treatment of casualties and diseases. Innovations in ICT offer unprecedented healthcare opportunities in remote regions throughout the world. Mobile devices using wireless connectivity are growing in popularity as thin clients that can be linked to centralized or distributed medical-data sources. These devices provide for local data storage of medical data, which can be retrieved and sent back to a centralized source when Internet access becomes available. Those working in nomadic environments are connected to data sources that in the past were inaccessible due to a lack of telephone and cable lines. For the military, paramedics, social workers, and other healthcare providers in the field, ICT advances have removed technology barriers that made mobility difficult if not impossible. Personal digital assistants (PDAs)1 are mobile devices that continue to grow in popularity. PDAs are typically considered more usable for multimedia data than smaller wireless devices (e.g., cell phones) because of larger screens, fully functional keyboards, and operating systems that support many desktop features. Over the past several years, PDAs have become far less costly than personal-computing technology. They are portable, lightweight, and mobile when compared to desktop computers. Yet, they offer similar functionality scaled back to accommodate the differences in user-interface designs, data transmission speed, memory, processing power, data storage capacity, and battery life.
Conference papers on the topic "Linear Waiting Costs"
1
Chugunov, Svyatoslav, and Iskander Akhatov. "Modeling of Linear Atmospheric Plasma Reactor." In ASME 2012 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/imece2012-86139.
Full textAbstract:
Methods of materials deposition and coating based on atmospheric pressure plasma (APP) have gained significant attention these days. Keeping the setup operation at low cost, APP units provide quality pre-processing of chemical agents with subsequent delivery of activated materials onto the surface of interest. These units eliminate the need for vacuum chambers, simplify thermal control of the setup, and widen the range of applicable chemical precursors. Considering the above mentioned factors, the APP becomes a recognizable choice for industrial applications and laboratory use. Demonstrating advanced performance and possibilities, APP reactors are still a subject to certain challenges that have to be overcome with future research. Among them are clogging of output channels with processed material, accurate estimations of mixing zone for efficient material activation, and uniform on-demand distribution of activated material over the substrate. These problems are still waiting for elegant and effective solutions. We investigate possibilities provided by use of a Linear Plasma Head — a portable APP reactor targeted for enhanced surface coatings. Currently we present our theoretical model of plasma generation in Linear Plasma Head. Numerical simulations are carried out using a parallel computational paradigm. The results and methods discussed in this paper yield with theory-based approach to building an advanced APP-based chemical reactor.
2
Motriuk, Roman W. "Modelling of Flexible Victaulic Couplings Using Basic Finite Element Software." In 2008 7th International Pipeline Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/ipc2008-64301.
Full textAbstract:
In the past decade, Victaulic couplings have gained significant recognition as important piping elements, which are used mainly in water and slurry transportation systems. For example, grooved flexible Victaulic couplings offered significant economical and reliable piping connections when compared to other connecting elements such as flanges. Victaulic couplings are on average three times faster to install than welding piping connections. They are more reliable and cost-effective than flanges or threaded connectors. In addition, the speed and easiness of their assembly or disassembly as well as their flexibility and ability to provide thermal gaps make the couplings desirable as piping elements. Furthermore, the couplings provide stress designers with a rare opportunity to cheaply and reliably compensate for piping loads which are otherwise exerted on equipment attached to piping. For the above reasons Victaulic couplings are frequently used in current piping designs. In spite of their simple design and application they pose a significant challenge for stress designers. The stress software packages based on piping finite element theories which are commonly used in industry do not provide the means to model Victaulic couplings adequately. These packages are based on stress linear theories, and Victaulic couplings with their gaps are definitely non-linear elements. Therefore, the approach to model these elements is very approximate and is usually done by the use of nonlinear restraints built into the software. The stiffness and friction for Victaulic coupling “restraints” are rarely known and assumptions of their values have to be made in order to carry out calculations. Therefore, the prescribed values for the restraints directly influence the stress results. This work discusses assumptions based on several simple stress models. An attempt is made by the author to minimize conservatism as much as practical in the modelling of Victaulic couplings, while waiting for the manufacturers of these elements to test their products and provide meaningful statistical information, which could then be used to carry out stress predictions. The couplings’ stiffness, bending moment and axial force capabilities provided in this work must not be used for design purposes unless verified and accepted by the couplings’ manufacturers.