Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Management Science and Financial Engineering
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 9, Issue 2 - Nov 2003
Volume 9, Issue 1 - May 2003
Selecting the target year
A Note on the Relationships among the Queue Lengths at Various Epochs of a Queue with BMAP Arrivals
Kim, Nam K ; Chae, Kyung C ; Lee, Ho W ;
Management Science and Financial Engineering, volume 9, issue 2, 2003, Pages 1~12
For a stationary queue with BMAP arrivals, Takine and Takahashi  present a relationship between the queue length distributions at a random epoch and at a departure epoch by using the rate conservation law of Miyazawa . In this note, we derive the same relationship by using the elementary balance equation, ‘rate-in = rate-out’. Along the same lines, we additionally derive relationships between the queue length distributions at a random epoch and at an arrival epoch. All these relationships hold for a broad class of finite-as well as infinite-capacity queues with BMAP arrivals.
Policy Capturing LP for Ranged Ratings in Performance Appraisal
Jung, Ho-Won ;
Management Science and Financial Engineering, volume 9, issue 2, 2003, Pages 13~20
For inferring criteria in a performance appraisal. linear programming (LP) has been utilized as an alternative to policy capturing (PC). Previous policy capturing LP (PCLP) studies were limited to the criteria of exact numerical ratings. However. under certain evaluation circumstances, a ranged rating with a lower and upper bound may be preferred over an exact numerical value. Therefore, this study introduces a new LP model that allows ranged ratings. A simple example is given to illustrate our model.
Business Process Change Design from Decision Model Perspective
Han, Hyun-Soo ;
Management Science and Financial Engineering, volume 9, issue 2, 2003, Pages 21~45
Various organizational factors effect successful implementation of IT enabled business transformation. Among them, the most critical success factor is deemed to overcoming change management problem. Lots of studies have been made on implementation methodologies and business process formalizations to encourage organizational members to accept new business process changes. However, the logic of process redesign still depends on qualitative problem solving techniques mostly depending on basically human intuition such as brainstorming, cause-and-effect analysis, and so on. In this paper, we develop algorithmic procedure applicable to designing various business process changes such as process automation, business process resequencing, and more radical process integration. The framework is employed from dynamic programming approach in the literature, which is based on the decision making paradigm of organizations to abstract business processes as quantitative decision models. As such, our research can fill the gap of limited development of theory based analytic methodologies for business process design, by providing objective rationale to reach the consensus among the organizational members including senior management.
Customer Order Scheduling Problems on Parallel Machines with Job Capacity Restriction
Yang, Jaehwan ;
Management Science and Financial Engineering, volume 9, issue 2, 2003, Pages 47~68
We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.