2020-07-09T18:20:30Z
http://www.jise.ir/?_action=export&rf=summon&issue=599
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
1
The Hypergeometric Coupon Collection Problem and its Dual
Sheldon M.
Ross
Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all of the balls of at least one type.
Hypergeometric
Dual
Coupon collection problem
2007
04
01
1
7
http://www.jise.ir/article_3913_1ed2be3e1d960879081aa5426697e54d.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
1
A Quartic Quality Loss Function and Its Properties
Yahya
Fathi
Chanwut
Poonthanomsook
We propose a quartic function to represent a family of continuous quality loss functions. Depending on the choice of its parameters the shape of this function within the specification limits can be either symmetric or asymmetric, and it can be either similar to the ubiquitous quadratic loss function or somewhat closer to the conventional step function. We examine this family of loss functions in the context of their industrial applications and use them in a mathematical programming model for the parameter design problem.
Quality cost
Continuous loss function
Parameter design problem
2007
04
01
8
22
http://www.jise.ir/article_3914_e9239b7a8fd53903e70d667adc0a9b8c.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
1
Development of a Set of Algorithms for the Multi-Project Scheduling Problems
Farhad
Ghassemi-Tari
Laya
Olfat
In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a collection of operations and there is a due date associated with the completion of each operation on each machine. Four algorithms based on the concept of “apparent tardiness cost” (ATC) are developed for solving the GTF problem. The relative effectiveness of the developed algorithms will then be evaluated through an extensive computational experiment.
Generalized tardiness flowshop
Multi-project scheduling
Intermediate due date
Apparent tardiness cost
2007
04
01
23
36
http://www.jise.ir/article_3915_d87ba4f6561a370e07819346be143e51.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
1
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
Mehdi
Kargahi
Ali
Movaghar
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of service and are served non-preemptively. An important performance measure to calculate is the loss probability. The performance of the system is approximated by a Markovian model in the long run. A key parameter, namely, the loss rate when there are n jobs in the system is used in the model, which is estimated by partitioning the system into two subsystems. The resulting model can then be solved analytically using standard Markovian solution techniques. The number of servers in the system may change due to failure or repair. The performability of the system is evaluated in the presence of such structural changes. The latter measure is approximated by a Markov reward model, considering the loss probability as the reward rate. Comparing numerical and simulation results, we find that the existing errors are relatively small.
Analytical methods
Earliest-deadline-first (EDF)
Firm real-time systems
Multiprocessor systems
Non-preemptive scheduling
Performability modeling
2007
04
01
37
55
http://www.jise.ir/article_3916_aaa3777e67a4004af2b3410a35904660.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
1
Product Development Decision Support System Customer-Based
Kioumars
Paryani
Quality Function Deployment (QFD) has been traditionally used as a planning tool primarily for product development and quality improvement. In this context, many people have used QFD for making decisions on how to prioritize critical product areas from a customer perspective. However, it is the position of the author that the QFD process can be viewed as a decision support system that would encompass multiple facets of information to enhance the quality and output of the decision making process in the course of product development. In this paper, the author submits the QFD process in combination with other engineering decision making tools such as the Pugh concept selection and the Kepner-Tregoe analysis technique as a decision making and modeling process that is as old as management science itself. Specifically, the attempt is made to illustrate how QFD provides an iterative sequence of steps involved in decision making, from the initial problem identification to a proposal for the actual implementation plan. To make this position more applicable to the reader, the subject has been approached from an actual business environment.
Quality Function Deployment (QFD)
Voice of the Customer (VOC)
Decision
making process
Customer-driven decision making process
Kepner-Tregoe analysis
Pugh
concept selection
Models
2007
04
01
56
69
http://www.jise.ir/article_3917_b6c520b1fb26bd66b9adffb7c83322c3.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
1
A Project Scheduling Method Based on Fuzzy Theory
Ahmad
Soltani
Rasoul
Haji
In this paper a new method based on fuzzy theory is developed to solve the project scheduling problem under fuzzy environment. Assuming that the duration of activities are trapezoidal fuzzy numbers (TFN), in this method we compute several project characteristics such as earliest times, latest times, and, slack times in term of TFN. In this method, we introduce a new approach which we call modified backward pass (MBP). This approach, based on a linear programming (LP) problem, removes negative and infeasible solutions which can be generated by other methods in the backward pass calculation. We drive the general form of the optimal solution of the LP problem which enables practitioners to obtain the optimal solution by a simple recursive relation without solving any LP problem. Through a numerical example, calculation steps in this method and the results are illustrated.
Project scheduling
Fuzzy theory
Modified backward pass (MBP)
Trapezoidal
fuzzy number (TFN)
Linear programming (LP)
2007
04
01
70
80
http://www.jise.ir/article_3918_df96a7fb6694f0b730ab1d9aa78e3c47.pdf
Journal of Industrial and Systems Engineering
jise
1735-8272
1735-8272
2007
1
1
Layout Design of a Furniture Production Line Using Formal Methods
Pinto
Wilsten J.
E.
Shayan
This paper experiments application of different heuristic approaches to a real facility layout problem at a furniture manufacturing company. All the models are compared using AHP, where a number of parameters of interest are employed. The experiment shows that formal layout modelling approaches can be effectively used real problems faced in industry, leading to significant improvements.
Facilities layout design
Layout algorithms
Optimisation
Production lines
2007
04
01
81
96
http://www.jise.ir/article_3919_4f23a91e7241ff54c92514a0a1796d1e.pdf