All Issues

Volume 18, 2022

Volume 17, 2021

Volume 16, 2020

Volume 15, 2019

Volume 14, 2018

Volume 13, 2017

Volume 12, 2016

Volume 11, 2015

Volume 10, 2014

Volume 9, 2013

Volume 8, 2012

Volume 7, 2011

Volume 6, 2010

Volume 5, 2009

Volume 4, 2008

Volume 3, 2007

Volume 2, 2006

Volume 1, 2005

Journal of Industrial and Management Optimization

January 2014 , Volume 10 , Issue 1

Select all articles


A cross-layer relay selection scheme of a wireless network with multiple relays under Rayleigh fading
Hong Il Cho, Myungwoo Lee and Ganguk Hwang
2014, 10(1): 1-19 doi: 10.3934/jimo.2014.10.1 +[Abstract](2451) +[PDF](612.4KB)
In this paper, we consider a decode-and-forward wireless relay network consisting of a source node, a destination node and multiple relay nodes under Rayleigh fading. Cooperative diversity of the network is achieved by using an opportunistic relay selection. To maximize the benefit of cooperative diversity, we propose a novel cross-layer single relay selection scheme, called the First-Channel-and-Second-Buffer (FCSB) scheme, that considers the performances of both the physical and data link layers. To examine the performance of the proposed FCSB scheme, we develop an analytical model that describes the queueing process of the source node, and derive the average packet delay of the FCSB scheme from our analytical model. Our analytical model is verified through simulation. We discuss how to optimally design the proposed FCSB scheme to minimize the average packet delay. We also show that the optimized FCSB scheme outperforms other relay selection schemes from the viewpoint of average packet delay.
Effect of spectrum sensing overhead on performance for cognitive radio networks with channel bonding
Haruki Katayama, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
2014, 10(1): 21-40 doi: 10.3934/jimo.2014.10.21 +[Abstract](2787) +[PDF](412.5KB)
In cognitive radio networks, secondary spectrum users detect available frequency channels by spectrum sensing. In general, the sensing time is communication overhead, and affects system's performance. In this paper, we theoretically consider the effect of sensing overhead on the system performance for cognitive radio networks with channel bonding. Specifically, we model the system with a multidimensional continuous-time Markov chain whose state is defined by the numbers of primary users, secondary users, and sensing users. The blocking probability, the forced termination probability and the throughput are derived. The analysis is validated by Monte Carlo simulation. Numerical examples show that the forced termination probability is not affected by sensing overhead, while the blocking probability and the throughput degrade with the increase in the sensing time. It is also shown that the optimal number of bonded sub-channels for the throughput performance significantly depends on the offered load from primary users.
Catastrophe equity put options under stochastic volatility and catastrophe-dependent jumps
Hwa-Sung Kim, Bara Kim and Jerim Kim
2014, 10(1): 41-55 doi: 10.3934/jimo.2014.10.41 +[Abstract](3818) +[PDF](214.3KB)
This paper develops a catastrophe equity put (CatEPut) option model under realistic assumptions. To reflect the phenomena of real data, we adopt the following assumptions. First, following the reasoning in Lin and Wang [12], we assume that the loss index follows a compound Poisson process with jumps of a mixture of Erlangs. Second, the volatility of stock return is assumed to be stochastic as in Heston [8]. Under the assumptions, we derives a pricing formula for CatEPut options. Numerical examples are given to insist that the pricing formula can be easily implemented numerically. We also confirm the validity and accuracy of implementation of the pricing formula by comparing the numerical results obtained by the pricing formula with those obtained by the Monte Carlo simulation.
The FIFO single-server queue with disasters and multiple Markovian arrival streams
Yoshiaki Inoue and Tetsuya Takine
2014, 10(1): 57-87 doi: 10.3934/jimo.2014.10.57 +[Abstract](3709) +[PDF](492.8KB)
We consider a FIFO single-server queue with disasters and multiple Markovian arrival streams. When disasters occur, all customers are removed instantaneously and the system becomes empty. Both the customer arrival and disaster occurrence processes are assumed to be Markovian arrival processes (MAPs), and they are governed by a common underlying Markov chain with finite states. There are $K$ classes of customers, and the amounts of service requirements brought by arriving customers follow general distributions, which depend on the customer class and the states of the underlying Markov chain immediately before and after arrivals. For this queue, we first analyze the first passage time to the idle state and the busy cycle. We then obtain two different representations of the Laplace-Stieltjes transform of the stationary distribution of work in system, and discuss the relation between those. Furthermore, using the result on the workload distribution, we analyze the waiting time and sojourn time distributions, and derive the joint queue length distribution.
Analysis of an M/M/1 queueing system with impatient customers and a variant of multiple vacation policy
Dequan Yue, Wuyi Yue, Zsolt Saffer and Xiaohong Chen
2014, 10(1): 89-112 doi: 10.3934/jimo.2014.10.89 +[Abstract](4316) +[PDF](459.4KB)
In this paper, we consider an M/M/1 queueing system with impatient customers and a variant of multiple vacation policy, where we examine the case that customer impatience is due to the servers' vacation. Whenever a system becomes empty, the server takes a vacation. However, the server is allowed to take a maximum number $K$ of vacations if the system remains empty after the end of a vacation. This vacation policy includes both a single vacation and multiple vacations as special cases. We derive the probability generating functions of the steady-state probabilities and obtain the closed-form expressions of the system sizes when the server is in different states. We further make comparisons between the mean system sizes under the variant vacation policy and the mean system sizes under the single vacation policy or the multiple vacation policy. In addition, we obtain the closed-form expressions for other important performance measures and discuss their monotonicity with respect $K$. Finally, we present some numerical results to show the effects of some parameters on some performance measures.
Performance analysis of large-scale parallel-distributed processing with backup tasks for cloud computing
Tsuguhito Hirai, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
2014, 10(1): 113-129 doi: 10.3934/jimo.2014.10.113 +[Abstract](3565) +[PDF](410.4KB)
In cloud computing, a large-scale parallel-distributed processing service is provided where a huge task is split into a number of subtasks and those subtasks are processed on a cluster of machines called workers. In such a processing service, a worker which takes a long time for processing a subtask makes the response time long (the issue of stragglers). One of efficient methods to alleviate this issue is to execute the same subtask by another worker in preparation for the slow worker (backup tasks). In this paper, we consider the efficiency of backup tasks. We model the task-scheduling server as a single-server queue, in which the server consists of a number of workers. When a task enters the server, the task is split into subtasks, and each subtask is served by its own worker and an alternative distinct worker. In this processing, we explicitly derive task processing time distributions for the two cases that the subtask processing time of a worker obeys Weibull or Pareto distribution. We compare the mean response time and the total processing time under backup-task scheduling with those under normal scheduling. Numerical examples show that the efficiency of backup-task scheduling significantly depends on workers' processing time distribution.
The impact of the $NT$-policy on the behaviour of a discrete-time queue with general service times
Bart Feyaerts, Stijn De Vuyst, Herwig Bruneel and Sabine Wittevrongel
2014, 10(1): 131-149 doi: 10.3934/jimo.2014.10.131 +[Abstract](3074) +[PDF](594.2KB)
In this paper, we analyse the behaviour of a discrete-time single-server queueing system with general service times, equipped with the $NT$-policy. This is a threshold policy designed to reduce the number of service unit activation/deactivation cycles, whilst ensuring an acceptable delay trade-off. Once the server is deactivated, reactivation will be postponed until either $N$ customers have accumulated in the queue or the first customer has been in the queue for $T$ slots, whichever happens first. Due to this modus operandi, the system circulates between three phases: empty, accumulating and serving.
    We assume a Bernoulli arrival process of customers and independent and identically distributed service times. Using a probability generating functions approach, we obtain expressions for the steady-state distributions of the phase sojourn times, the cycle length, the system content and the customer delay. The influence of the threshold parameters $N$ and $T$ on the mean sojourn times and the expected delay is discussed by means of numerical examples.
Performance analysis of a P2P storage system with a lazy replica repair policy
Shunfu Jin, Yuan Zhao, Wuyi Yue and Lingling Chen
2014, 10(1): 151-166 doi: 10.3934/jimo.2014.10.151 +[Abstract](3148) +[PDF](300.8KB)
Peer-to-Peer (P2P) storage systems are a prevalent and important mode for implementing cost-efficient, large-scale distributed storage. Considering the random departure feature of the peers and the diverse popularity of the data objects, a proper number of replicas needs to be maintained, and a reasonable trigger threshold of replica repair needs to be set for high data availability and low system overhead. In this paper, based on the working principle of the lazy replica repair policy in a P2P storage system, a three-dimensional Markov chain model is constructed, and the model is analyzed in steady-state by using a matrix-geometric method. Then, the performance measures in terms of the availability of one data object, the average access latency, and the replication rate are given. Moreover, numerical results with analysis are provided to demonstrate how system parameters such as the replica number and the replica repair instant influence the system performance. Finally, we develop benefit functions to optimize the replica number and the repair trigger threshold.
A dual tandem queueing system with GI service time at the first queue
Zsolt Saffer and Wuyi Yue
2014, 10(1): 167-192 doi: 10.3934/jimo.2014.10.167 +[Abstract](3313) +[PDF](500.6KB)
In this paper we consider the analysis of a tandem queueing model $M/G/1 -> ./M/1$. In contrast to the vast majority of the previous literature on tandem queuing models we consider the case with GI service time at the first queue and with infinite buffers. The system can be described by an M/G/1-type Markov process at the departure epochs of the first queue. The main result of the paper is the steady-state vector generating function at the embedded epochs, which characterizes the joint distribution of the number of customers at both queues. The steady-state Laplace-Stieljes transform and the mean of the sojourn time of the customers in the system are also obtained.
    We provide numerical examples and discuss the dependency of the steady-state mean of the sojourn time of the customers on several basic system parameters. Utilizing the structural characteristics of the model we discuss the interpretation of the results. This gives an insight into the behavior of this tandem queuing model and can be a base for developing approximations for it.
A continuous-time queueing model with class clustering and global FCFS service discipline
Willem Mélange, Herwig Bruneel, Bart Steyaert, Dieter Claeys and Joris Walraevens
2014, 10(1): 193-206 doi: 10.3934/jimo.2014.10.193 +[Abstract](3628) +[PDF](585.1KB)
In this paper the focus is on ``class clustering" in a continuous-time queueing model with two classes and dedicated servers. ``Class clustering" means that customers of any given type may (or may not) have a tendency to ``arrive back-to-back". We believe this is a concept that is often neglected in literature and we want to show that it can have a considerable impact on multiclass queueing systems, especially on the system considered in this paper. This system adopts a ``global FCFS" service discipline, i.e., all arriving customers are accommodated in one single FCFS queue, regardless of their types. The major aim of our paper is to quantify the intuitively expected (due to the service discipline) negative impact of ``class clustering" on the performance measures of our system. The motivation of our work are systems where this kind of inherent blocking is encountered, such as input-queueing network switches, road splits or security checks at airports.
Variance-optimal hedging for target volatility options
Xingchun Wang and Yongjin Wang
2014, 10(1): 207-218 doi: 10.3934/jimo.2014.10.207 +[Abstract](3320) +[PDF](371.6KB)
In this paper, we consider a variance-optimal hedge for target volatility options, under exponential Lévy dynamics. Since the payoff of target volatility options is related with realized volatility of some underlying asset, which is path-dependent, it is difficult to price this instrument. Here we will derive an explicit Föllmer-Schweizer decomposition of the contingent claim of target volatility options and then give the explicit expressions of hedging strategies in both discrete time and continuous time.
A survey of single machine scheduling to minimize weighted number of tardy jobs
Muminu O. Adamu and Aderemi O. Adewumi
2014, 10(1): 219-241 doi: 10.3934/jimo.2014.10.219 +[Abstract](5826) +[PDF](466.3KB)
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time $p_j$ and due date $d_j$. The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job $j$ is $C_j>d_j$ and on-time otherwise. This paper assesses works done to minimize the weighted number of tardy jobs by providing an extensive review of authors, methods and techniques used. Finally, the possible direction for future research is presented.
A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors
Le Thi Hoai An, Tran Duc Quynh and Kondo Hloindo Adjallah
2014, 10(1): 243-258 doi: 10.3934/jimo.2014.10.243 +[Abstract](4178) +[PDF](304.0KB)
In this paper, we introduce a new approach based on DC (Difference of Convex functions) Programming and DCA (DC Algorithm) for minimizing the maintenance cost involving flow-time and tardiness penalties by optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors. The main idea is to divide the horizon considered into $H$ intervals. The problem is first formulated as a mixed integer linear problem (MILP) and then reformulated as a DC program. A solution method based on DCA is used to solve the resulting problem. The efficiency of DCA is compared with the algorithm based on the new flow-time and tardiness rule (FTR) given in [1]. The computational results on several test problems show that the solutions provided by DCA are better.
Heuristics for parallel machine scheduling with batch delivery consideration
Leiyang Wang and Zhaohui Liu
2014, 10(1): 259-273 doi: 10.3934/jimo.2014.10.259 +[Abstract](3246) +[PDF](366.4KB)
We consider the parallel machine scheduling problem in which the finished jobs need to be delivered to a customer in batches by a single vehicle. The goal is to minimize the makespan, i.e., the time by which the vehicle has delivered all jobs and returned to its initial location. We distinguish two types of batching strategies. The strategy of Type 1 permits the jobs processed on different machines to compose a delivery batch, and the strategy of Type 2 assumes that only the jobs processed on the same machine can compose a batch. For both types of the $m$-machine case, we propose $(2-\frac{1}{m})$-approximation algorithms respectively. For both types of the two-machine case, we obtain two improved $\frac{4}{3}$-approximation algorithms.
The control parameterization method for nonlinear optimal control: A survey
Qun Lin, Ryan Loxton and Kok Lay Teo
2014, 10(1): 275-309 doi: 10.3934/jimo.2014.10.275 +[Abstract](9271) +[PDF](598.1KB)
The control parameterization method is a popular numerical technique for solving optimal control problems. The main idea of control parameterization is to discretize the control space by approximating the control function by a linear combination of basis functions. Under this approximation scheme, the optimal control problem is reduced to an approximate nonlinear optimization problem with a finite number of decision variables. This approximate problem can then be solved using nonlinear programming techniques. The aim of this paper is to introduce the fundamentals of the control parameterization method and survey its various applications to non-standard optimal control problems. Topics discussed include gradient computation, numerical convergence, variable switching times, and methods for handling state constraints. We conclude the paper with some suggestions for future research.
Convergence analysis of Euler discretization of control-state constrained optimal control problems with controls of bounded variation
Matthias Gerdts and Martin Kunkel
2014, 10(1): 311-336 doi: 10.3934/jimo.2014.10.311 +[Abstract](3990) +[PDF](630.1KB)
We study convergence properties of Euler discretization of optimal control problems with ordinary differential equations and mixed control-state constraints. Under suitable consistency and stability assumptions a convergence rate of order $1/p$ of the discretized control to the continuous control is established in the $L^p$-norm. Throughout it is assumed that the optimal control is of bounded variation. The convergence proof exploits the reformulation of first order necessary optimality conditions as nonsmooth equations.
Towards an optimization theory for deforming dense granular materials: Minimum cost maximum flow solutions
Qun Lin and Antoinette Tordesillas
2014, 10(1): 337-362 doi: 10.3934/jimo.2014.10.337 +[Abstract](2948) +[PDF](10159.8KB)
We use concepts and techniques of network optimization theory to gain a better understanding of force transmission in dense granular materials. Specifically, we represent a deforming granular material over the different stages of a quasi-static biaxial compression test as a series of representative flow networks, and analyze force transmission through these networks. The forces in such a material are transmitted through the contacts between the constituent grains. As the sample deforms during the various stages of the biaxial test, these grains rearrange: while many contacts are preserved in this rearrangement process, some new contacts form and some old contacts break. We consider the maximum flow problem and the minimum cost maximum flow (MCMF) problem for the flow networks constructed from this evolving network of grain contacts. We identify the flow network bottleneck and establish the sufficient and necessary conditions for a minimum cut of the maximum flow problem to be unique. We also develop an algorithm to determine the MCMF pathway, i.e. a set of edges that always transmit non-zero flow in every solution of the MCMF problem. The bottlenecks of the flow networks develop in the locality of the persistent shear band, an intensively-studied phenomenon that has long been regarded as the signature failure microstructure for dense granular materials. The cooperative evolution of the most important structural building blocks for force transmission, i.e. the force chains and 3-cycles, is examined with respect to the MCMF pathways. We find that the majority of the particles in the major load-bearing columnar force chains and 3-cycles consistently participate in the MCMF pathways.

2021 Impact Factor: 1.411
5 Year Impact Factor: 1.441
2021 CiteScore: 2.1




Email Alert

[Back to Top]