The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The main aim of this paper is to express the techniques which can solve reactive scheduling problem in operating room and then compare them for ranking. On the one hand importance of scheduling for operating rooms in hospitals is increasing for the reasons like hospitals reputations and expenses and on the other hand in real world, scheduling of operating rooms is not often static. Hence, the authors...
We provide upper and lower bounds on the spectral radius of Halin graphs and some other classes of k-outerplanar graphs. For both the Halin and the k-outerplanar cases we provide examples where the bounds are met, thus demonstrating sharpness. The upper bound in the Halin case, improves upon Shu et al.'s claimed bound for a very wide class of graphs. A consequence of the upper bound is a generalization...
Dominance measuring methods are an approach for dealing with complex decision-making problems with imprecise information within multi-attribute value/utility theory. These methods are based on the computation of pairwise dominance values and exploit the information in the dominance matrix in different ways to derive measures of dominance intensity and rank the alternatives under consideration. In...
In this paper we consider a realistic production setting, referred to the Distributed Assembly Permutation Flowshop Scheduling Problem or DAPFSP in short. The problem consists of two stages, production and assembly. The paper is an extension of the recent work by Hatami et al. [6], that the additional consideration of sequence-dependent setup times (SDST) is added on both production and assembly stages...
In this work, we focus on the problem of virtual machines (VMs) placement in geographically distributed data centers, where tenants may require a set of networking VMs. The aim of the present work is to plan and optimize the placement of tenant's VMs in a distributed Cloud environment while considering location and system performance constraints. Thus, we propose ILP formulations which have as objective...
We study the integration of the carbon emission constraint into the single item uncapacitated lot sizing problem (ULSP) under the cap-and-trade policy. Besides a limitation on the total carbon emitted through the production and storage activities over the entire hoziron, the cap-and-trade policy allows the firm to buy and to sell carbon units in case of need or surplus. In addition to the classical...
The present paper considers a supply chain which consists of a customer and two capacitated suppliers. The customer receives the proposition of a new product procurement and seeks to allocate demand volume to suppliers in a manner to maximize his profit. Suppliers employ base stock policies for inventory replenishment. Each supplier chooses a base stock level which maximizes his profit. In addition,...
In this research, we are interested in the permutation flowshop scheduling problem with minimal and maximal time lags while minimizing the total tardiness. The processing order of jobs is to be the same for each machine. The time lag is defined as the waiting time between two consecutive operations of each job. It is greater than or equal to a prescribed value called minimal time lag and smaller than...
Credit rating prediction using clustering algorithms has become more and more important in the financial literature. Expanding the ideas of [4] and [5], we propose an approach to generate models for automated credit rating prediction based on support vector domain description (SVDD) and linear regression (LR). The models include the prediction for sovereign and corporate bonds. Another advantage is,...
In this paper we investigate the use of the large neighborhood search for solving the vehicle routing problem with two-dimensional loading constraints, an NP-hard combinatorial optimization problem. Such a problem may be viewed as the combination of two complementary well-known problems: two-dimensional bin-packing and capacitated vehicle routing. The proposed method considers a two-phase solution...
Finding and classifying all efficient solutions for a Bi-Objective Integer Linear Programming (BOILP) problem is one of the controversial issues in Multi-Criteria Decision Making problems. The main aim of this study is to utilize the well-known Data Envelopment Analysis (DEA) methodology to tackle this issue. Toward this end, we first state some propositions to clarify the relationships between the...
This paper aims to study a new form of facility layout problem, in which the building has already been constructed and the specific room layout inside has been determined. Unlike the traditional facility layout problem, what we take into account is how to assign a certain number of rooms to a given number of departments with the purpose of maximizing the utilization rate of the rooms. This is equivalent...
An orthogonal ray graph is a graph such that for each vertex, there exists an axis-parallel rays (closed half-lines) in the plane, and two vertices are adjacent if and only if the corresponding rays intersect. A 2-directional orthogonal ray graph is an orthogonal ray graph such that the corresponding ray of each vertex is a rightward ray or a downward ray. We recently showed in [12] that the weighted...
Hospitals use very costly medical equipment like scanners, RMI, endoscopy equipment or operating rooms. In this paper, we propose a mixed integer model to schedule patients on different hospital resources they can need during their stay in a hospital. We study the case of multiple types of resources and for each type the existence of several parallel units. The objective is to minimize the sum of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.