All issues
Volume 19 (1976)
- Issue 4 Pages 255-
- Issue 3 Pages 193-
- Issue 2 Pages 99-
- Issue 1 Pages 1-
Volume 19, Issue 1
Displaying 1-11 of 11 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
1976 Volume 19 Issue 1 Pages Cover1-
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (88K) -
Article type: Appendix
1976 Volume 19 Issue 1 Pages App1-
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (80K) -
TADASHI KURISUArticle type: Article
1976 Volume 19 Issue 1 Pages 1-13
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn a general two-machine n-job scheduling problem, it is assumed that every possible sequence of jobs can be executed, so that whichever best served a given measure can be selected. This paper considers two more restricted cases in which certain orderings are prohibited, either by technological constraints or by externally imposed policy. In the first case, some of the decisions of a schedule have already been made and the schedule must be completed without altering what has been decided. In the second case, jobs are grouped into disjoint subsets within which a job order is specified, but which May be preempted between jobs. For each of these two cases, a rule is given for determining the sequence in which jobs are to be processed on the machines in order to minimize the total elapsed time.View full abstractDownload PDF (582K) -
MASAO MORIArticle type: Article
1976 Volume 19 Issue 1 Pages 14-31
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe qualitative natures of the transient behaviours of the waiting times in a GI/G/1 system are studied first, when the waiting time of the initial customer is V. For instance, it is shown that the mean waiting time is in-creasing in n only when v < 〓 for some 〓. Next this paper gives a way of calculating exact values of the mean waiting time of the n-th arrival in M/M/1 and M/D/1 and further proposes a simple scale of the rate of convergence to the equilibrium state.View full abstractDownload PDF (933K) -
MASAO IRI, NOBUAKI TOMIZAWAArticle type: Article
1976 Volume 19 Issue 1 Pages 32-57
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe ordinary assignment problem on a bipartite graph with weighted arcs is extended to the case where both of the two sets of vertices of the graph are given matroidal structures, and a practical solution algorithm is presented to this extended problem.View full abstractDownload PDF (1234K) -
TAKAYOSHI OHMIArticle type: Article
1976 Volume 19 Issue 1 Pages 58-69
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSTraffic queue formed when a stochastic vehicle stream is interrupted by a single duration of blockage, or of red signal, is analysed. It is assumed that the delayed vehicles depart with constant intervals when the interruption is terminated. The probability distribution of the number of delayed vehicles. the moments of that distribution and the expected total delay are obtained using Wald's identity in sequential analysis. The expressions for those quantities are rigorous with a Poisson input stream and are approximated with the general input stream. In addition, the influence of initial condition of interruption is discussed with relation to the bounds on mean number of delayed vehicles.View full abstractDownload PDF (555K) -
TOSHIHIDE IBARAKI, HIROAKI ISHII, HISASHI MINEArticle type: Article
1976 Volume 19 Issue 1 Pages 70-90
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper deals with a problem of assigning n persons to n nodes (jobs) in a given network, whose arc lengths are dependent upon the assignment, so that the length of a critical path in the network may be minimized. The problem is first formulated as an integer programming probem, and then a branch-and-bound algorithm is proposed. The algorithm makes use of lower bounds obtained from the generated LP (linear programming) problems. Each LP problem is efficiently solved by reducing them to a series of rather small LP problems with two types of auxiliary problems : the ordinary assignment problems and the critical path problems.View full abstractDownload PDF (903K) -
JUNICHI NAKAGAMIArticle type: Article
1976 Volume 19 Issue 1 Pages 91-98
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSConsider the dynamic inventory problem when the ordering cost function is linear with multiple set-up costs. In general, an optimal inventory policy is sensitive to the form of the ordering cost, so that the purpose of this note is to define a new policy, ie, a batch (s,S) policy and to show the sufficient conditions under which this policy is optimal.View full abstractDownload PDF (356K) -
Article type: Appendix
1976 Volume 19 Issue 1 Pages App2-
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (115K) -
Article type: Cover
1976 Volume 19 Issue 1 Pages Cover2-
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (69K) -
Article type: Cover
1976 Volume 19 Issue 1 Pages Cover3-
Published: 1976
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (69K)
- |<
- <
- 1
- >
- >|