Internet media planning : an optimization model

Of the various media vehicles available for advertising, the internet is the latest and the most rapidly growing, emerging as the ideal medium to promote products and services in the global market. In this article, the authors propose an internet media planning model whose main objective is to help advertisers determine the return they obtain from spending on internet advertising. Using available data such as internet page view and advertising performance data, the model contributes to attempts not only to optimize the internet advertising schedule but also to fix the right price for internet advertisements on the basis of the characteristics of the exposure distribution of sites. The authors test the model with data provided by KoreanClick, a Korean market research company that specializes in internet audience measurement. The optimal durations for the subject sites provide some useful insights. The findings contrast with current web media planning practices, and the authors demonstrate the potential savings that could be achieved if their approach were applied.media planning; optimization; advertising repeat exposure; probability distribution; internet

Planning and Scheduling Transportation Vehicle Fleet in a Congested Traffic Environment

Transportation is a main component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routing is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic nature of travel times in this problem. In this paper, a vehicle routing problem with time windows and stochastic travel times due to potential traffic congestion is considered. The approach developed introduces mainly the traffic congestion component based on queueing theory. This is an innovative modeling scheme to capture the stochastic behavior of travel times. A case study is used both to illustrate the appropriateness of the approach as well as to show that time-independent solutions are often unrealistic within a congested traffic environment which is often the case on the european road networkstransportation; vehicle fleet; planning; scheduling; congested traffic

A bibliometric analysis and visualization of decision support systems for healthcare referral strategies

Background: The referral process is an important research focus because of the potential consequences of delays, especially for patients with serious medical conditions that need immediate care, such as those with metastatic cancer. Thus, a systematic literature review of recent and influential manuscripts is critical to understanding the current methods and future directions in order to improve the referral process. Methods: A hybrid bibliometric-structured review was conducted using both quantitative and qualitative methodologies. Searches were conducted of three databases, Web of Science, Scopus, and PubMed, in addition to the references from the eligible papers. The papers were considered to be eligible if they were relevant English articles or reviews that were published from January 2010 to June 2021. The searches were conducted using three groups of keywords, and bibliometric analysis was performed, followed by content analysis. Results: A total of 163 papers that were published in impactful journals between January 2010 and June 2021 were selected. These papers were then reviewed, analyzed, and categorized as follows: descriptive analysis (n = 77), cause and effect (n = 12), interventions (n = 50), and quality management (n = 24). Six future research directions were identified. Conclusions: Minimal attention was given to the study of the primary referral of blood cancer cases versus those with solid cancer types, which is a gap that future studies should address. More research is needed in order to optimize the referral process, specifically for suspected hematological cancer patients

Home cancer care research: a bibliometric and visualization analysis (1990-2021)

Home cancer care research (HCCR) has accelerated, as considerable attention has been placed on reducing cancer-related health costs and enhancing cancer patients' quality of life. Understanding the current status of HCCR can help guide future research and support informed decision-making about new home cancer care (HCC) programs. However, most current studies mainly detail the research status of certain components, while failing to explore the knowledge domain of this research field as a whole, thereby limiting the overall understanding of home cancer care. We carried out bibliometric and visualization analyses of Scopus-indexed papers related to home cancer care published between 1990-2021, and used VOSviewer scientometric software to investigate the status and provide a structural overview of the knowledge domain of HCCR (social, intellectual, and conceptual structures). Our findings demonstrate that over the last three decades, the research on home cancer care has been increasing, with a constantly expanding stream of new papers built on a solid knowledge base and applied to a wide range of research themes

Elaboration et mise en place d'un système d'information hospitalier au sein d'un service d'oncologie médicale

International audienc

ANALYSIS OF OPEN FINITE QUEUEING NETWORKS (OPTIMIZATION, APPROXIMATIONS)

Interest in queueing networks and their solutions have flourished over the past two decades largely due to their potential applications in computer systems, communication networks, facilities planning, and flexible manufacturing systems. The majority of efficient computational techniques that have been developed deal mainly with unrestricted queueing networks because of their well-behaved mathematical characteristics. Since finite queueing networks are extremely complex for exact analysis, there is growing interest in their approximate analysis. The main thrust of this thesis addresses the development of approximation techniques for estimating the performance measures within these open finite queueing networks. The techniques which are based on expanding and then decomposing the networks with general interarrival and service time distributions. Small (n (LESSTHEQ) 3) as well as large (n \u3e 3) open finite queueing networks are examined the results are validated by simulation. The second thrust of this thesis is concerned with the optimal routing of customers within open finite queueing networks. Not only is the problem complex because of its stochastic aspect, it is complex because of the multi-objective nature of the problem. A heuristic based on the k-th shortest path algorithm is divised to find the approximate Nondominated sets of routes with respect to the following two objectives: (1) Minimize average sojourn times in the network; (2) Minimize processing costs in the network. All the developed methodologies for analyzing open finite queueing networks are successfully tested on a large network representing a hypothetical manufacturing facility

Planning and Scheduling Transportation Vehicle fleet in a Congested Traffic Environment

The popularity of Supply Chain Management in theory and practice is still increasing. This book provides a unique overview of current research trends and practices in the field from European scholars. Departing at selected theoretical inquiries on prominent concepts and methodologies in the supply chain field (e.g. theoretical foundations, 4PL concept, configurational approaches), the contributions in this volume cover highly relevant topics along a generic supply chain - upstream activities relating to modularisation, the development of logistical capabilities, but also order-picking optimization in warehouses, distribution network design heuristics and issues of urban freight transportation operations are among the topics treated. The methodologies employed intendedly reflect the variety of long-standing European research traditions and range from state-of-the art quantitative modelling to intriguing theoretical advances. The book is aimed at scholars and senior students interested in the SCM field as well as at the interested practitione

Multi-Objective Routing Within Large Scale Facilities Using Open Finite Queueing Networks

The major objective of this paper is to examine the optimal routing in layout and location problems from a network optimization perspective where manufacturing facilities are modelled as open finite queueing networks with a multiobjective set of performance measures. The overall material handling system is broken down into a set of layout topologies. For each one of these topologies the optimal routing is determined so that the product throughput is maximized while minimizing the average sojourn time and holding costs. An approximate analytical decomposition technique for modelling open finite queueing networks, called the Generalized Expansion Method (GEM), developed by the authors, is utilized to calculate the desired outputs. A mathematical optimization procedure which is described in this paper is then used to determine the optimal routes. As will be demonstrated, the design methodology of combining the optimization and analytical queueing network models provides a very effective procedure for evaluating alternative topologies while simultaneously determining the average sojourn times and the maximum throughputs of the best routes