Time-limited polling systems with batch arrivals and?phase-type service times

In this paper, we develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. According to the autonomous-server discipline, the server continues servicing a queue for a certain period of time. According to the time-limited service discipline, the server continues servicing a queue for a certain period of time or until the queue becomes empty, whichever occurs first. We consider Poisson batch arrivals and phase-type service times. It is known that these disciplines do not satisfy the well-known branching property in polling systems. Therefore, hardly any exact results exist in the literature. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-lengths at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains.     

On the gi/m/∞ service system with batch arrivals and different types of service distributions

We study the infinite-server system with batch arrivals ands different types of customers. With probabilityp _i an arriving customer is of typei (i=1,..., s) and requires an exponentially distributed service time with parameter _i (G ^GI /M ₁ ...M _s /). For theGI ^GI /M ₁...M _s / system it is shown that the binomial moments of thes-variate distribution of the number of type-i customers in the system at batch arrival epochs are determined by a recurrence relation and, in steady state, can be computed recursively. Furthermore, forG ^GI /M ₁...M _s /, relations between the distributions (and their binomial moments) of the system size vector at batch arrival and random epochs are given. Thus, earlier results by Takács [14], Gastwirth [9], Holman et al. [11], Brandt et al. [3] and Franken [6] are generalized.     

Project scheduling with finite or infinite number of activity processing modes – A survey

This paper surveys single-project, single-objective, deterministic project scheduling problems in which activities can be processed using a finite or infinite (and uncountable) number of modes concerning resources of various categories and types. The survey is based on a unified framework of a project scheduling model including resources, activities, objectives, and schedules. Most important models and solution approaches across the class of problems are characterized, and directions for future research are pointed out.     

Stability Analysis of Decoupled Solution Strategies for Coupled Multi-field Problems – A General Framework

A coupled partial differential equation (PDE) system, stemming from the mathematical modelling of a coupled phenomenon, is usually solved numerically following a monolithic or a decoupled solution method. In spite of the potential unconditional stability offered by monolithic solvers, their usage for solving complex problems sometimes proves cumbersome. This has motivated the development of various partitioned and staggered solution strategies, generally known as decoupled solution schemes. To this end, the problem is broken down into several isolated yet communicating sub-problems that are independently advanced in time, possibly by different integrators. Nevertheless, using a decoupled solver introduces additional errors to the system and, therefore, may jeopardise the stability of the solution [1]. Consequently, to scrutinise the stability of the solution scheme becomes a pertinent step in proposing decoupled solution strategies. Here, we endeavour to present a practical stability analysis algorithm, which can readily be used to reveal the stability condition of numerical solvers. To illustrate its capabilities, the algorithm is then utilised for the stability analysis of solution schemes applied to multi variate coupled PDE systems resulting from the mathematical modelling of surface- and volume-coupled multi-field problems. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A location–allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations

The capacitated multi-facility Weber problem is concerned with locating m facilities in the Euclidean plane, and allocating their capacities to n customers at minimum total cost. The deterministic version of the problem, which assumes that customer locations and demands are known with certainty, is a non-convex optimization problem and difficult to solve. In this work, we focus on a probabilistic extension and consider the situation where the customer locations are randomly distributed according to a bivariate distribution. We first present a mathematical programming formulation, which is even more difficult than its deterministic version. We then propose an alternate location–allocation local search heuristic generalizing the ideas used originally for the deterministic problem. In its original form, the applicability of the heuristic depends on the calculation of the expected distances between the facilities and customers, which can be done for only very few distance and probability density function combinations. We therefore propose approximation methods which make the method applicable for any distance function and bivariate location distribution.     

A two‐level queueing network model with blocking and non‐blocking messages

We analyze a novel twolevel queueing network with blocking, consisting of N level1 parallel queues linked to M level2 parallel queues. The processing of a customer by a level1 server requires additional services that are exclusively offered by level2 servers. These level2 servers are accessed through blocking and nonblocking messages issued by level1 servers. If a blocking message is issued, the level1 server gets blocked until the message is fully processed at the level2 server. The queueing network is analyzed approximately using a decomposition method, which can be viewed as a generalization of the wellknown twonode decomposition algorithm used to analyze tandem queueing networks with blocking. Numerical tests show that the algorithm has a good accuracy.     

The one-dimensional cutting stock problem with usable leftovers – A survey

In this article, we review published studies that consider the solution of the one-dimensional cutting stock problem (1DCSP) with the possibility of using leftovers to meet future demands, if long enough. The one-dimensional cutting stock problem with usable leftovers (1DCSPUL) is a problem frequently encountered in practical settings but often, it is not dealt with in an explicit manner. For each work reviewed, we present the application, the mathematical model if one is proposed and comments on the computational results obtained. The approaches are organized into three classes: heuristics, item-oriented, or cutting pattern-oriented.     

The one-dimensional cutting stock problem with usable leftover – A heuristic approach

In this work we consider a one-dimensional cutting stock problem in which the non-used material in the cutting patterns may be used in the future, if large enough. This feature introduces difficulties in comparing solutions of the cutting problem, for example, up to what extent a minimum leftover solution is the most interesting one when the leftover may be used. Some desirable characteristics of good solutions are defined and classical heuristic methods are modified, so that cutting patterns with undesirable leftover (not large enough to be used, nor too small to be acceptable waste) are redesigned. The performance of the modified heuristics is observed by solving instances from the literature, practical instances and randomly generated instances.     

A hybrid hypercube – Genetic algorithm approach for deploying many emergency response mobile units in an urban network

Emergency response services are critical for modern societies. This paper presents a model and a heuristic solution for the optimal deployment of many emergency response units in an urban transportation network and an application for transit mobile repair units (TMRU) in the city of Athens, Greece. The model considers the stochastic nature of such services, suggesting that a unit may be already engaged, when an incident occurs. The proposed model integrates a queuing model (the hypercube model), a location model and a metaheuristic optimization algorithm (genetic algorithm) for obtaining appropriate unit locations in a two-step approach. In the first step, the service area is partitioned into sub-areas (called superdistricts) while, in parallel, necessary number of units is determined for each superdistrict. An approximate solution to the symmetric hypercube model with spatially homogeneous demand is developed. A Genetic Algorithm is combined with the approximate hypercube model for obtaining best superdistricts and associated unit numbers. With both of the above requirements defined in step one, the second step proceeds in the optimal deployment of units within each superdistrict.     

A Stone–Weierstrass Type Theorem for an Unstructured Set – with Applications

A general version of the Stone–Weierstrass theorem is presented – one which involves no structure on the domain set of the real valued functions. This theorem is similar to the Stone–Weierstrass theorem which appears in the book by Gillman and Jerison, but instead of involving the concept of stationary sets the one presented here involves stationary filters. As a corollary to our results we obtain Nel's theorem of Stone–Weierstrass type for an arbitrary topological space. Finally, an application is made to the setting of Cauchy spaces.     

Joint pricing and procurement of substitutable products with random demands – A technical note

Single-period joint pricing and procurement of substitutable products entails one time procurement and pricing decisions for substitutable products that face price dependent stochastic demands. Recently, Karakul and Chan [Karakul, M., Chan, L., 2008. Analytical and managerial implications of integrating product substitutability in the joint pricing and procurement problem. European Journal of Operational Research 190, 179–204] considered this problem for two one-way substitutable products. Authors model the demands for each product in the well known additive form, where the mean demands are linear functions of the price of the high grade new product plus an additive stochastic noise term. By assuming that the noise term for the low grade existing product follows a general discrete distribution and the noise term for the high grade product follows a general continuous distribution, authors are able to show the unimodality of the expected profit function with respect to the procurement quantities and the price of the new product. In this paper, we extend this result to the case where the noise term in the demand of the low grade product follows a general continuous distribution as well.     

A note on certain matrices with h(x) – Fibonacci quaternion polynomials

In this paper we consider a g – circulant, right circulant, left circulant and a special kind of a tridiagonal matrices whose entries are h(x) – Fibonacci quaternion polynomials. We present the determinant of these matrices and with the tridiagonal matrices we show that the determinant is equal to the nth term of the h(x) – Fibonacci quaternion polynomial sequences.     

Smart Composite Structures with Embedded Sensors for Load and Damage Monitoring – A Review

Mechanics of Composite Materials - Fibre-reinforced polymer (FRP) composite materials are widely used in different branches of industry, especially in aerospace, owing to their low mass, high...     

Phase-field modeling of martensitic phase transformations in polycrystals coupled with crystal plasticity – A spectral-based approach

The purpose of this work is the phase-field modeling of fcc-to-bcc martensitic phase transformations in polycrystals and the coupling with crystal plasticity. Assuming microscopic periodic fields, Green-function- and fast Fourier transform (FFT)-methods are used to solve the quasi-static balance of linear momentum. The Allen-Cahn evolution equation is discretized based on a semi-implicit time integration scheme in Fourier space. Two-dimensional results are presented and the interplay between martensitic phase transformation and plastic slip is studied at different stages of the deformation. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Crack opening displacement for two unequal straight cracks with coalesced plastic zones – A modified Dugdale model

The problem investigated is of an infinite plate weakened by two collinear unequal hairline straight quasi-static cracks. Uniform constant tension is applied at infinity in a direction perpendicular to the rims of the cracks. Consequently the rims of the cracks open in Mode I type deformation. The tension at infinity is increased to the limit such that the plastic zones developed at the two adjacent interior tips of cracks get coalesced. To arrest the crack from further opening normal cohesive variable stress distribution is applied on the rims of the plastic zones. Closed form analytic expressions are obtained for load bearing capacity and crack opening displacement (COD). An illustrative case is discussed to study the behavior of load bearing capacity and crack opening displacement with respect to affecting parameters viz. crack length, plastic zone length and inter crack distance between the two cracks. Results obtained are reported graphically and analyzed.     

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

In most deterministic scheduling problems, job-processing times are regarded as constant and known in advance. However, in many realistic environments, job-processing times can be controlled by the allocation of a common resource to jobs. In this paper, we consider the problem of scheduling jobs with arbitrary release dates and due dates on a single machine, where job-processing times are controllable and are modeled by a non-linear convex resource consumption function. The objective is to determine simultaneously an optimal processing permutation as well as an optimal resource allocation, such that no job is completed later than its due date, and the total resource consumption is minimized. The problem is strongly NP\mathcal{NP}-hard. A branch and bound algorithm is presented to solve the problem. The computational experiments show that the algorithm can provide optimal solution for small-sized problems, and near-optimal solution for medium-sized problems in acceptable computing time.     

A Cournot–Nash–Bertrand game theory model of a service-oriented Internet with price and quality competition among network transport providers

This paper develops a game theory model of a service-oriented Internet in which profit-maximizing service providers provide substitutable (but not identical) services and compete with the quantities of services in a Cournot–Nash manner, whereas the network transport providers, which transport the services to the users at the demand markets, and are also profit-maximizers, compete with prices in Bertrand fashion and on quality. The consumers respond to the composition of service and network provision through the demand price functions, which are both quantity and quality dependent. We derive the governing equilibrium conditions of the integrated game and show that it satisfies a variational inequality problem. We then describe the underlying dynamics, and provide some qualitative properties, including stability analysis. The proposed algorithmic scheme tracks, in discrete-time, the dynamic evolution of the service volumes, quality levels, and the prices until an approximation of a stationary point (within the desired convergence tolerance) is achieved. Numerical examples demonstrate the modeling and computational framework.     

On the Solvability of x∈Ax＋λBx in a General Cone with A and B Multivalued k－set－contractive

ＯｎｔｈｅＳｏｌｖａｂｉｌｉｔｙｏｆｘ∈Ａｘ＋λＢｘｉｎａＧｅｎｅｒａｌＣｏｎｅ　ｗｉｔｈＡａｎｄＢＭｕｌｔｉｖａｌｕｅｄ　ｋ－ｓｅｔ－ｃｏｎｔｒａｃｔｉｖｅＺｈａｎｇＱｉｎｇｙｏｎｇ（张庆雍）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｓｉｃ...