All issues
Volume 44 (2001)
- Issue 4 Pages 301-
- Issue 3 Pages 207-
- Issue 2 Pages 101-
- Issue 1 Pages 1-
Volume 44, Issue 2
Displaying 1-12 of 12 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
2001 Volume 44 Issue 2 Pages Cover4-
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (16K) -
Article type: Appendix
2001 Volume 44 Issue 2 Pages App3-
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (62K) -
Wei Feng, Masashi Kowada, Kouichi AdachiArticle type: Article
2001 Volume 44 Issue 2 Pages 101-124
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn this paper, we considera polling system consisting of two-parallel queues and a single server under an (M,N)-threshold nonpreemptive priority service schedule. Two thresholds M and N (0<>__-M<N) are set up in one of two queues, say, the second queue. At each epoch of service completion, the server decides which queue is to be served next according to the control level reached by the number of customers in the second queue. For the queueing model, we carry out the performance analysis by using the transform method and propose an algorithm to compute the generating functions of the stationary joint queue length distributions at service completion instants. We also determine the Laplace-Stieltjes transforms of the waiting time distributions for both queues, and obtain their mean waiting times.View full abstractDownload PDF (1671K) -
Keisuke MatsuyamaArticle type: Article
2001 Volume 44 Issue 2 Pages 125-139
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSAssume that one day's demand for products, one day's holding cost per one unit of product and setup cost are expressed as increasing functions of time. Moreover assume that we are given a time interval under these circumstances. The aim of our study is to find the optimal inventory policy which minimizes the total inventory cost required during this interval. How often orders are placed during this interval and how much is ordered at each ordering time point are our concerns. The techniques of DP are introduced to solve this problem.View full abstractDownload PDF (819K) -
Jinliang Cheng, Yoshiyuki Karuno, Hiroshi KiseArticle type: Article
2001 Volume 44 Issue 2 Pages 140-156
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper considers a scheduling problem of minimizing the maximum lateness for a parallel-machine flowshop with m stages, each of which consists of one or more identical parallel machines. We propose a heuristic algorithm being based on a shifting bottleneck approach which decomposes the parallel-machine flowshop problem into m parallel-machine scheduling problems to be solved one by one. Each parallel-machine problem is approximately solved by applying a property of its reversibility in the proposed heuristic. To evaluate performance of the proposed heuristic, it is numerically compared with Wittrock's algorithm for a real production line, and with Santos et al.'s global lower bound for test problem instances randomly generated. The results obtained strongly suggest that the proposed heuristic produces optimal or quite near optimal solutions within short computational time with high probability.View full abstractDownload PDF (1245K) -
Takayuki Kawamura, Junzo WatadaArticle type: Article
2001 Volume 44 Issue 2 Pages 157-168
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSWhen we decide the production of each agricultural product in the uncertain circumstance where its sell price, climate, consumers' preference and so on are not known previously, we should take its risk as well as the best expected selling volume or its interest into consideration. In this paper we employ fuzzy mean-variance analysis to decide the optimal solution in agricultural management which minimizes the risk and maximizes the expected selling volume. The mean-variance analysis is proposed by H. Markowitz and widely employed in stock investment. Nevertheless, it is also hard to treat an aspiration beheld by a decision-maker, because the formulation given by H. Markowitz is written using constant rigid values. In this paper a fuzzy number is employed to deal with a vague aspiration level and a fuzzy goal given by a decision-maker, that is, the fuzzy mean-variance analysis enables us to obtain the best solution which is realized within a vague aspiration lelel and a fuzzy goal. In the method, the decision maker defines a necessity level and a sufficient level for each of expected interest rate and risk. The decision-maker can obtain a solution that satisfies an aspiration level and a fuzzy goal required. The effectiveness of our method is shown using a numerical example.View full abstractDownload PDF (921K) -
Norio HibikiArticle type: Article
2001 Volume 44 Issue 2 Pages 169-193
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper discusses optimal dynamic investment policies for investors, who make investment decisions in each of the asset categories over time. We propose linear programming models using simulated paths to solve large-scale problems in practice. Linear programming models can be formulated to adopt either fixed-value rule or fixed-amount rule instead of general fixed-proportion rule. These formulations can be simply implemented and solved very fast. Some numerical examples are tested to illustrate the characteristics of the models. These models can be used to improve trade-off between risk and expected wealth, and we can get interesting results for dynamic asset allocation policies.View full abstractDownload PDF (2146K) -
Daishin Nakamura, Akihisa TamuraArticle type: Article
2001 Volume 44 Issue 2 Pages 194-204
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe maximum weight/cardinality stable set problem is to find a maximum weight/cardinality stable set of a given graph. It is well known that these problems for general graphs belong to the class of NP-hard. However, for several classes of graphs, e.g., for perfect graphs and claw-free graphs and so on, these problems can be solved in polynomial time. For instance, Minty (1980), Sbihi (1980) and Lovasz and Plummer (1986) have proposed polynomial time algorithm finding a maximum cardinality stable set of a claw-free graph. Moreover, it has been believed that Minty's algorithm is the unique polynomial time algorithms finding a maximum weight stable set of a daw-free graph up to date. Here we show that Minty's algorithm for the weighted version fails for some special cases, and give modifications to overcome it.View full abstractDownload PDF (1017K) -
Article type: Appendix
2001 Volume 44 Issue 2 Pages 205-206
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (182K) -
Article type: Appendix
2001 Volume 44 Issue 2 Pages App4-
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (250K) -
Article type: Cover
2001 Volume 44 Issue 2 Pages Cover5-
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (39K) -
Article type: Cover
2001 Volume 44 Issue 2 Pages Cover6-
Published: 2001
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (39K)
- |<
- <
- 1
- >
- >|