컴퓨터 시스템 作業計劃에 관한 硏究 : 注文生産 計劃 接近方法을 中心으로 a heuristic approach = Computer System Jop Scheduling

다국어 초록 (Multilingual Abstract)

The purpose of this study is to find effective scheduling rules, with job shop
approach, which can be used practically and give us effective scheduling for com-
puter system operation, to minimize the sum of lateness job or failing this the
sum of lateness times is minimized.
in order to lay out a schedule we need a rule or set of rules. Sinse the sche-
duling problem is one of determining precedence or ordering in time among a
number of jobs, an operation scheduling rules includes a means of determining
priorities of jobs. The scheduling rule (or complex of rules) may do more than
this, for example, it may say: schedule the job with the least slack, but if this
forces another job to be late then schedule other job instead.
In this study following scheduling rules (priority dispatching rules) are used. 1) Minimum job slack
2) Minimum job slack per operations
3) Minimum job slack ratio
4) Length of next operation(shortest imminent operation)
5) Minimum length of next operation together with job slack ratio
6) Shortest out-put time (since most of queue occurs on line priter)
7) First come, first served. Also two alternate operation rules (heuristics) which anticipate the progress of a scheduling are incorporated with those rules, which are alternate operation 1,
and alternate operation 2.
1) Alternate operation 1;
When scheduling a job according to priority dispatching rules, in case a critical job occurs (that is, see if the job slack of any other job has just become negative, or if positive, has reached certain critical level), schedule that job, and the job selected by priority dispatching rule will be scheduled the next times.
2) Alternate operation 2;
When a job is selected by scheduling rules or alternate operation
1, and the job still meet its due times. In case it may be also anticipated that a critical job may be arrived to those machine, on which the job selected by scheduling rules or alternate operation 1 is still being processed, then schedule this critical job first.
The approach is simulative in that the operation of computer system is simulated in a FORTRAN program.
The results of this study are following.
1) priority dispatching rules based on the job slack in some reasonable way
are more effective than other rules.
2) There are little choice between rules in some reasonable way upon job slack,
so simple rule (for example, job slack ratio) should be used.
3) In case the measure of performance is to minimize sum of lateness jobs,
there are little choice between rules based on job slack and shortest output
time rule, so shortest output time rule rather used since it is more simple than job slack rules.
4) In case the rules based on shortest process time are bolstered by alternate
operation I are more effective.
5) In accordance with the measure of performance, there are some variation in
performance of schduling rules. For example with 'minimize sum of late-
ness times',the order is rule 5, (1,2), 3, 4, 6, 7 according to increasing
lateness times, but with 'minimize sum of lateness jobs', the order is rule
4, (1,2), 6, 5, 3, 7 when blined use of the scheduling rules.
6) 'First come, first served' rule is less effective than other rules.
Hence when scheduling for computer system operation, priority dispatching
rule based on the job slack and shortest output time rule are more effective
than other rules. So it is desirable to use these rules.
In case multiprogramming it will be more effective to place the job on high
priority partitions which has minimum job slack or minimum output time,
since the job placing on higher priority partitions can be processed more
rapidly than on lower priority partitions.

목차 (Table of Contents)

• 第1章 序 論
• 第2章 컴퓨터 시스템에서의 作業處理
• 第3章 注文生産計劃 理論에 대한 考察
• 第1節 注文生産 시스템의 特性
• 第2節 注文生産의 스케쥴링(Scheduling)
• 第3節 스케쥴링의 效果測定
• 第4章 컴퓨터 시스템 作業計劃 시뮬레
• 이터(Simulator)
• 第1節 시뮬레이터의 設計
• 第2節 入力 副프로그램(Input Subp-
• rogram)
• 第3節 處理 副프로그램(Process Su-
• bprogram)
• 第4節 出力 副프로그램(Output Sub-
• program)
• 第5章 시뮬레이션 結果와 分析
• 第1節 入力데이타 選定
• 第2節 作業計劃의 效果 分析
• 第6章 結 論