2020-07-09T18:34:38Z
http://www.jise.ir/?_action=export&rf=summon&issue=627
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
2
Strategies to Overcome Network Congestion in Infrastructure Systems
Jason W.
Black
Richard C.
Larson
Networked Infrastructure systems deliver services and/or products from point to point along the network. Demand for the services provided by such systems is typically cyclic, creating inefficiencies in capacity utilization. Congestion pricing provides incentives to shift demand from peak time periods to lower demand periods. This effectively increases the capacity of the system without the need for additional capital investment. This paper investigates the potential for congestion pricing to reduce necessary infrastructure investments in the United States. Several types of congestion pricing schemes are presented, along with existing implementations across multiple infrastructure systems. We find over $20 billion in potential annual savings in electricity and road systems alone in the United States from implementing congestion pricing schemes.
Networked infrastructure systems
Congestion Pricing
Capacity utilization
2007
09
01
97
115
http://www.jise.ir/article_3921_0826543f09926b2d6f95f47c8a2b16ef.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
2
A Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
I.N.
Kamalabadi
A.H.
Mirzaei
B.
Javadi
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and minimizing the risk of obtaining higher total costs simultaneously. This approach is applicable to just-in-time systems, in which many firms face the need to complete jobs as close as possible to their due dates. The objective of the model is to minimize the total costs of earliness/tardiness penalties. In this paper, the proposed possibility linear programming approach is applied to a fuzzy single machine scheduling problem with respect to the overall degree of decision maker satisfaction. Due to the proposed modelâ€™s complexity, conventional optimization methods cannot be utilized in reasonable time. Hence, the particle swarm optimization method is applied toward its solution.
Single machine scheduling
Earliness / tardiness
Possibility linear programming
Particle Swarm Optimization
2007
09
01
116
129
http://www.jise.ir/article_3922_bc6e60fa8368ccc24108f6c6e004a714.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
2
Price Discount and Stochastic Initial Inventory in the Newsboy Problem
Maryam
Haji
Rasoul
Haji
Houshang
Darabi
Many extension of the newsboy problem have been solved in the literature. One of those extensions solves a newsboy problem with stochastic initial inventory, earlier extensions have focused on quantity discounts offered by suppliers. An important practical extension would address a combination of the two pervious extensions. In this paper we consider a newsboy problem in which the suppliers offer quantity discount and the initial inventory at the beginning of the period is a random variable. We obtain the optimal value of the order quantity which maximizes the total profit and then present the results for some practical distributions of both random variables, demand and initial inventory.
Stochastic initial inventory
Newsboy problem
Inventory management
Supplier
discount
2007
09
01
130
138
http://www.jise.ir/article_3923_32fd0b80aa077d13466aee54f11a6201.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
2
An Evaluation of Mahalanobis-Taguchi System and Neural Network for Multivariate Pattern Recognition
Elizabeth A.
Cudney
Jungeui
Hong
Rajesh
Jugulum
Kioumars
Paryani
Kenneth M.
Ragsdell
Genichi
Taguchi
The Mahalanobis-Taguchi System is a diagnosis and predictive method for analyzing patterns in multivariate cases. The goal of this study is to compare the ability of the Mahalanobis- Taguchi System and a neural-network to discriminate using small data sets. We examine the discriminant ability as a function of data set size using an application area where reliable data is publicly available. The study uses the Wisconsin Breast Cancer study with nine attributes and one class.
Mahalanobis-Taguchi System
Mahalanobis distance
Neural Network
Pattern
recognition
Orthogonal array
Signal-to-noise ratio
Mahalanobis space (reference group)
2007
09
01
139
150
http://www.jise.ir/article_3924_5f31f4ac2ae98ac31c98b527e637819e.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
2
A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
Abdelghani
Bekrar
Imed
Kacem
Chengbin
Chu
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a dichotomous algorithm and a branch and price method. The three methods were carried out and compared on literature instances.
Strip packing
lower and upper bound
Branch and bound
dichotomous search
column generation
branch and price
2007
09
01
151
170
http://www.jise.ir/article_3925_c0e029a3afa0c02dd4ecd8426daea585.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
2
Fuzzy Hierarchical Location-Allocation Models for Congested Systems
Hassan
Shavandi
Hashem
Mahlooji
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networks, location of servers and allocation of demand nodes have a strong impact on the length of queues at servers as well as on the response times to service calls. The thrust of this article is the development of hierarchical location-allocation models for congested systems by employing queueing theory in a fuzzy framework. The new models allow partial coverage of demand nodes and approximate determination of parameters. Using queueing theory and fuzzy conditions, both referral and nested hierarchical models are developed for the maximal covering location problem (MCLP). An example is solved for both an existing probabilistic model and the new fuzzy models and the results are compared.
Location
Hierarchical
Queueing
Fuzzy Sets
Congested Systems
Referral
systems
Nested systems
2007
09
01
171
189
http://www.jise.ir/article_3926_f5ad283c3686e617c9dc96d75782144c.pdf