JPH04177457A - Multi-resouce system scheduling system - Google Patents

Multi-resouce system scheduling system

Info

Publication number
JPH04177457A
JPH04177457A JP2302930A JP30293090A JPH04177457A JP H04177457 A JPH04177457 A JP H04177457A JP 2302930 A JP2302930 A JP 2302930A JP 30293090 A JP30293090 A JP 30293090A JP H04177457 A JPH04177457 A JP H04177457A
Authority
JP
Japan
Prior art keywords
processing
exchange
resources
resource
evaluation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP2302930A
Other languages
Japanese (ja)
Inventor
Kazuo Koike
小池 和雄
Masao Honda
本多 正雄
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP2302930A priority Critical patent/JPH04177457A/en
Publication of JPH04177457A publication Critical patent/JPH04177457A/en
Pending legal-status Critical Current

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

PURPOSE:To shorten the processing time for a scheduling job by allocating the processing tasks to plural resources on the average at an early stage of the scheduling job, selecting two resources that perform the exchange of processing tasks, and selecting the exchange of processing tasks so as to minimize the difference of evaluation value between both resources. CONSTITUTION:An average allocation means 1 performs the initialization processing. A processing task exchange resource selection means 2 evaluates each resource to which a processing task is allocated and selects the resources of the maximum and minimum evaluation values respectively. A processing task exchange evaluation means 3 extracts one by one the processing tasks allocated to the two selected resources and obtains the evaluation values of both resources after exchange of the extracted processing tasks. A processing task exchange means 4 obtains selects the exchange where the difference of evaluation values between both sources is minimized after exchange of the processing tasks out of the exchanges tried by the means 3 end then carries out the selected exchange. A resource selection/evaluation means 5 evaluates the validity of selection and outputs the optimum scheduling result.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は情報処理システムにおける多資源システムスケ
ジューリング方式に関し、特に3つ以上の複数の資源を
持ち一定の処理を行う処理システムの処理タスク(その
処理システムにおける全体の処理を構成する個々の処理
単位。電子計算機の分野におけるプロセスを意味するタ
スクではない)を資源に割り当てるスケジューリングを
自動的に行う多資源システムスケジューリング方式に間
する。
[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a multi-resource system scheduling method in an information processing system, and particularly to a processing task (its We use a multi-resource system scheduling method that automatically performs scheduling to allocate resources to individual processing units that make up the overall processing in a processing system (not tasks that refer to processes in the field of electronic computers).

例えば、「複数の製品の製造」という処理を行う「工場
」という処理システムにおいて、「製造ライン」という
資源に「製造に要する時間」という負荷を持つ「個々の
製品の製造」という処理タスクを全製品の製造時間をで
きるだけ短くするように割り当てる場合のスケジューリ
ングを自動的に行う方式が該当する。
For example, in a processing system called a ``factory'' that performs the process of ``manufacturing multiple products,'' all the processing tasks of ``manufacturing individual products,'' which have a load of ``time required for manufacturing'', are placed on a resource called a ``manufacturing line.'' This is a method that automatically performs scheduling when allocating product manufacturing time to be as short as possible.

〔従来の技術〕[Conventional technology]

元来、多資源システムにおけるスケジューリングは、人
間の勘に軒って人手で行われるのが一般的であった。し
かし、人手によると、人件費に多くを要し、スケジュー
リングのためのノウハウがスケジューリングの担当者の
閉した情報となり担当者が交替した場合にはスケジュー
リング結果の効率(スケジューリングがなされた処理シ
ステムの処理の効率)が大幅に低下するという問題点が
あった。そこで、電子計算機を用いた情報処理システム
によって自動的に多資源システムにおけるスケジューリ
ングを行う多資源システムスケジューリング方式が採用
されるようになった。
Originally, scheduling in resource-rich systems was generally performed manually based on human intuition. However, manual labor requires a large amount of labor costs, and the know-how for scheduling becomes confidential information for the person in charge of scheduling.If the person in charge is replaced, the efficiency of the scheduling result (the processing of the processing system in which the scheduling was performed) The problem was that the efficiency of Therefore, a multi-resource system scheduling method has been adopted in which scheduling is automatically performed in a multi-resource system using an information processing system using a computer.

従来、この種の多資源システムスケジューリング方式で
は、全てのスケジューリングの可能性が試験され考察さ
れた上で、最終的なスケジューリングが決定される方式
が行われていた。
Conventionally, in this type of resource-rich system scheduling method, a method has been used in which all scheduling possibilities are tested and considered, and then the final scheduling is determined.

〔発明が解決しようとする課題〕[Problem to be solved by the invention]

上述した従来の多資源システムスケジューリング方式で
は、全てのスケジューリングの可能性が試験され考察さ
れた上で最終的なスケジューリングが決定されるので、
資源数をn(正整数)とし処理タスク数をm(正整数)
とするとnmのオーダでスケジューリングのための試験
回数が増加することとなり、処理タスクを実用的なレベ
ルで多く持つ処理システムのスケジューリングでは実質
的には実行不可能な程度にスケジューリング処理時間を
要することになるという欠点がある。
In the conventional resource-rich system scheduling method described above, the final scheduling is determined after all scheduling possibilities are tested and considered.
The number of resources is n (positive integer) and the number of processing tasks is m (positive integer).
If this is the case, the number of tests for scheduling will increase on the order of nanometers, and the scheduling processing time will be required to an extent that is practically impossible to schedule in a processing system that has a large number of processing tasks at a practical level. It has the disadvantage of becoming.

本発明の目的は、上述の点に鑑み、スケジューリングに
要する処理時間を短縮することができる多資源システム
スケジューリング方式を提供することにある。
In view of the above points, an object of the present invention is to provide a multi-resource system scheduling method that can shorten the processing time required for scheduling.

〔課題を解決するための手段〕[Means to solve the problem]

本発明の多資源システムスケジューリング方式は、複数
の資源を持ち処理を行う処理システムにおける処理タス
クを資源に割り当てるスケジューリングを自動的に行う
多資源システムスケジューリング方式おいて、スケジュ
ーリングの初めに処理タスクを複数の資源に平均的に割
り当てる平均割り当て手段と、処理タスクの交換を行う
2つの資源を選択する処理タスク交換資源選択手段と、
この処理タスク交換資源選択手段により選択された両資
源に割り当てられている処理タスクの1つずつを交換し
た後の両資源の評価値を求める処理タスク交換評価手段
と、この処理タスク交換評価手段により求められた評価
値に基づき前記処理タスク交換資源選択手段により選択
された両資源の評価値の差が最小になる処理タスクの交
換を選択して実際にその交換を行う処理タスク交換手段
と、前記処理タスク交換手段による処理の後に行われる
前記処理タスク交換資源選択手段による資源の選択が有
効か否かを評価する資源選択評価手段とを有する。
The multi-resource system scheduling method of the present invention is a multi-resource system scheduling method that automatically performs scheduling to allocate processing tasks to resources in a processing system that has multiple resources and performs processing. average allocation means for allocating on average to resources; processing task exchange resource selection means for selecting two resources for exchanging processing tasks;
A processing task exchange evaluation means for calculating the evaluation values of both resources after exchanging each one of the processing tasks assigned to both resources selected by the processing task exchange resource selection means, and the processing task exchange evaluation means. processing task exchange means that selects and actually performs the exchange of processing tasks that minimizes the difference between the evaluation values of the two resources selected by the processing task exchange resource selection means based on the obtained evaluation value; and resource selection evaluation means for evaluating whether or not the resource selection by the processing task exchange resource selection means performed after the processing by the processing task exchange means is effective.

〔作用〕[Effect]

本発明の多資源システムスケジューリング方式では、平
均割り当て手段がスケジューリングの初めに処理タスク
を複数の資源に平均的に割り当て、処理タスク交換資源
選択手段が処理タスクの交換を行う2つの資源を選択し
、処理タスク交換評価手段が処理タスク交換資源選択手
段により選択された両資源に割り当てられている処理タ
スクの1つずつを交換した後の両資源の評価値を求め、
処理タスク交換手段が処理タスク交換評価手段により求
められた評価値に基づき処理タスク交換資源選択手段に
より選択された両資源の評価値の差が最小になる処理タ
スクの交換を選択して実際にその交換を行い、資源選択
評価手段が処理タスク交換手段による処理の後に行われ
る処理タスク交換資源選択手段による資源の選択が有効
か否かを評価する。
In the multi-resource system scheduling method of the present invention, an average allocation means allocates processing tasks to a plurality of resources on an average basis at the beginning of scheduling, a processing task exchange resource selection means selects two resources for exchanging processing tasks, determining evaluation values of both resources after the processing task exchange evaluation means exchanges one by one the processing tasks assigned to both resources selected by the processing task exchange resource selection means;
The processing task exchange means selects the processing task exchange that minimizes the difference between the evaluation values of both resources selected by the processing task exchange resource selection means based on the evaluation value obtained by the processing task exchange evaluation means, and actually carries out the exchange. The resource selection evaluation means evaluates whether or not the resource selection by the processing task exchange resource selection means performed after the processing by the processing task exchange means is effective.

〔実施例〕 次に、本発明について図面を参照して詳細に説明する。〔Example〕 Next, the present invention will be explained in detail with reference to the drawings.

第1図は、本発明の多資源システムスケジューリング方
式の一実施例の構成を示すブロック図である。本実施例
の多資源システムスケジューリング方式は、平均割り当
て手段1と、処理タスク交換資源選択手段2と、処理タ
スク交換評価手段3と、処理タスク交換手段4と、資源
選択評価手段5とを含んで構成されている。
FIG. 1 is a block diagram showing the configuration of an embodiment of the multi-resource system scheduling method of the present invention. The multi-resource system scheduling method of this embodiment includes an average allocation means 1, a processing task exchange resource selection means 2, a processing task exchange evaluation means 3, a processing task exchange means 4, and a resource selection evaluation means 5. It is configured.

第2図は、本実施例の多資源システムスケジューリング
方式の処理を示す流れ図である。この処理は、初期化処
理ステップ21と、平均的割り当てステップ22と、資
源選択ステップ23と、交換評価値夏山ステップ24と
、全交換評価終了判定ステップ25と、交換ステップ2
6と、評価値改良判定ステップ27と、再交換ステップ
28と、資源選択ステップ29と、選択評価ステップ3
0と、終了処理ステップ31とからなる。
FIG. 2 is a flowchart showing the processing of the multi-resource system scheduling method of this embodiment. This process includes an initialization process step 21, an average allocation step 22, a resource selection step 23, an exchange evaluation value summer step 24, an all exchange evaluation completion determination step 25, and an exchange step 2.
6, evaluation value improvement determination step 27, re-exchange step 28, resource selection step 29, and selection evaluation step 3
0 and a termination processing step 31.

次に、このように構成された本実施例の多資源システム
スケジューリング方式の動作について説明する。
Next, the operation of the multi-resource system scheduling method of this embodiment configured as described above will be explained.

平均割り当て手段1は、スケジューリング対象の資源お
よび処理タスクに関する情報を入力してスケジューリン
グの準備を行う初期化処理を行う(ステップ21)。
The average allocation means 1 performs initialization processing to prepare for scheduling by inputting information regarding resources to be scheduled and processing tasks (step 21).

さらに、平均割り当て手段1は、後述する一連のスケジ
ューリング処理の前作業として、とりあえず全ての処理
タスクを各資源に平均的に(各資源に割り当てられる処
理タスク数が可能な限り同一になるように)割り当てる
(ステップ22)。
Furthermore, as a pre-work for a series of scheduling processes to be described later, the average allocation means 1 assigns all processing tasks to each resource on average (so that the number of processing tasks allocated to each resource is as same as possible). Assign (step 22).

処理タスク交換資源選択手段2は、平均割り当て手段1
により処理タスクが割り当てられた各資源を評価し、評
価値が最大の資源と最小の資源とを「処理タスクの交換
を行う2つの資源」として選択する(ステップ23)。
Processing task exchange resource selection means 2 average allocation means 1
Each resource to which a processing task has been assigned is evaluated, and the resource with the maximum evaluation value and the resource with the minimum evaluation value are selected as "two resources for exchanging processing tasks" (step 23).

ここで、「資源の評価値」とは、その資源に割り当てら
れた処理タスクの負荷(処理タスクを行うに要する処理
量。例えば、「個々の製品の製造」が処理タスクである
場合のその製造に要する時間)の和をいう。
Here, the "evaluation value of a resource" refers to the load of the processing task assigned to that resource (the amount of processing required to perform the processing task. For example, when "manufacturing individual products" is the processing task, ).

処理タスク交換評価手段3は、処理タスク交換資源選択
手段2によって選択された交換対象の2つの資源に割り
当てられている処理タスクを両資源について1つずつ抽
出し、抽出した2つの処理タスクを交換した後の両資源
の評価値を求める(ステップ24)。
The processing task exchange evaluation means 3 extracts the processing tasks assigned to the two resources to be exchanged selected by the processing task exchange resource selection means 2, one by one for both resources, and exchanges the two extracted processing tasks. Then, the evaluation values of both resources are determined (step 24).

さらに、処理タスク交換評価手段3は、ステップ24の
評価を全ての交換について行ったか否かを判定しくステ
ップ25)、まだ全ての交換の評価が終了していない場
合には両資源から抽出される処理タスクの組み合わせを
変更してステップ24の評価を繰り返し、全ての交換の
評価が終了している場合には処理タスク交換手段4に制
御を渡す、このようにして、ステップ23またはステッ
プ29(後述参照)で選択された2つの資源にステップ
22またはステップ26(後述参照)で割り当てられて
いる全ての処理タスクに関する交換に基づく評価が繰り
返して実行される。
Further, the processing task exchange evaluation means 3 determines whether or not the evaluation of step 24 has been performed for all exchanges (step 25), and if the evaluation of all exchanges has not been completed yet, the processing task exchange evaluation means 3 extracts the information from both resources. The evaluation in step 24 is repeated by changing the combination of processing tasks, and if the evaluation of all exchanges has been completed, control is passed to the processing task exchange means 4. In this way, step 23 or step 29 (described later) The exchange-based evaluation for all processing tasks assigned in step 22 or step 26 (see below) to the two resources selected in step 22 or step 26 (see below) is performed iteratively.

処理タスク交換手段4は、処理タスク交換評価手段3に
より試行され評価された交換の中で処理タスク交換後の
両資源の評価値の差が最小となる交換を選択して実際に
その交換を行う(ステップ26)。
The processing task exchange means 4 selects the exchange that minimizes the difference between the evaluation values of both resources after the processing task exchange among the exchanges tried and evaluated by the processing task exchange evaluation means 3, and actually performs the exchange. (Step 26).

さらに、処理タスク交換手段4は、ステップ26で実行
した交換によって両資源の評価値の差が交換前よりも小
さくなったか否かを判定する(ステップ27)。
Further, the processing task exchange means 4 determines whether or not the difference between the evaluation values of both resources has become smaller than before the exchange due to the exchange executed in step 26 (step 27).

この判定で小さくなった場合には、同じ2つの資源に関
してさらに最適な処理タスクの交換を探すために、処理
タスク交換手段4は処理タスク交換評価手段3によるス
テップ24の処理に制御を戻す。
If the result of this judgment is smaller, the processing task exchange means 4 returns control to the process of step 24 by the processing task exchange evaluation means 3 in order to search for a more optimal exchange of processing tasks regarding the same two resources.

ステップ27の判定で小さくならなかった場合には、処
理タスク交換手段4はステップ26で実行した交換を無
効にするために交換前の状態に戻しくステップ28)、
処理タスク交換資源選択手段2に制御を渡す。
If it is determined in step 27 that it has not become smaller, the processing task exchange means 4 returns to the state before the exchange in order to invalidate the exchange executed in step 26 (step 28);
Control is passed to the processing task exchange resource selection means 2.

処理タスク交換資源選択手段2は、その時点における各
資源を評価し、評価値が最大の資源と最小の資源とを「
処理タスクの交換を行う2つの責  ・源」として選択
しくステップ29)、資源選択評価手段5に制御を渡す
The processing task exchange resource selection means 2 evaluates each resource at that time, and selects the resource with the maximum evaluation value and the resource with the minimum evaluation value.
In step 29), control is passed to the resource selection evaluation means 5.

資源選択評価手段5は、ステップ29で選択された2つ
の資源が前回にステップ23またはステップ29で選択
された2つの資源と同じか否かを判定してステップ29
における選択の有効性を評価する(ステップ30)。
The resource selection evaluation means 5 determines whether or not the two resources selected in step 29 are the same as the two resources previously selected in step 23 or step 29.
Evaluate the effectiveness of the selection in (step 30).

ステップ30の判定で両者が違う場合(ステップ29に
おける選択が有効である場合)には、ステ、ブ29で選
択された新たな2つの資源に関して最適な処理タスクの
交換を探すために、資源選択評価手段5は処理タスク交
換評価手段3によるステップ24の処理に制御を戻す。
If the judgment in step 30 is that they are different (if the selection in step 29 is valid), the resource selection is performed in order to find the optimal exchange of processing tasks for the new two resources selected in step 29. The evaluation means 5 returns control to the processing of step 24 by the processing task exchange evaluation means 3.

ステップ30の判定で両者が同じ場合(ステップ29に
おける選択が有効でない場合)には、資源選択評価手段
5はその時点における各資源への各処理タスクの割り当
ての状態を最適なスケジューリング結果として出力する
終了処理を行う(ステップ31)。
If the determination in step 30 is that the two are the same (the selection in step 29 is not valid), the resource selection evaluation means 5 outputs the state of allocation of each processing task to each resource at that time as an optimal scheduling result. A termination process is performed (step 31).

〔発明の効果〕〔Effect of the invention〕

以上説明したように本発明は、複数の資源を持ち一定の
処理を行う処理システムにおいて、−旦平均的に各資源
に処理タスクを割り当てた状態からスケジューリングを
始めることと、評価値に基づいて処理タスクを交換する
対象の2つの資源を選択してそれらの資源だけで最適化
を試みることとにより、一定の効率を持つスケジューリ
ング結果を得るためのスケジューリングに要する処理時
間を短縮することができるという効果がある。
As explained above, in a processing system that has a plurality of resources and performs a certain process, the present invention starts scheduling from a state in which processing tasks are assigned to each resource on an average basis, and processes based on evaluation values By selecting two resources to exchange tasks and attempting optimization using only those resources, the processing time required for scheduling to obtain a scheduling result with a certain level of efficiency can be reduced. There is.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の一実施例の構成を示すブロック図、 第2図は第1図に示す多資源システムスケジューリング
方式の処理を示す流れ図である。 図において、 ■・・・平均割り当て手段、 2・・・処理タスク交換資源選択手段、3・・・処理タ
スク交換評価手段、 4・・・処理タスク交換手段、 5・・・資源選択評価手段である。
FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention, and FIG. 2 is a flow chart showing the processing of the multi-resource system scheduling method shown in FIG. In the figure, ■... average allocation means, 2... processing task exchange resource selection means, 3... processing task exchange evaluation means, 4... processing task exchange means, 5... resource selection evaluation means. be.

Claims (1)

【特許請求の範囲】 複数の資源を持ち処理を行う処理システムにおける処理
タスクを資源に割り当てるスケジューリングを自動的に
行う多資源システムスケジューリング方式おいて、 スケジューリングの初めに処理タスクを複数の資源に平
均的に割り当てる平均割り当て手段と、処理タスクの交
換を行う2つの資源を選択する処理タスク交換資源選択
手段と、 この処理タスク交換資源選択手段により選択された両資
源に割り当てられている処理タスクの1つずつを交換し
た後の両資源の評価値を求める処理タスク交換評価手段
と、 この処理タスク交換評価手段により求められた評価値に
基づき前記処理タスク交換資源選択手段により選択され
た両資源の評価値の差が最小になる処理タスクの交換を
選択して実際にその交換を行う処理タスク交換手段と、 前記処理タスク交換手段による処理の後に行われる前記
処理タスク交換資源選択手段による資源の選択が有効か
否かを評価する資源選択評価手段と を有することを特徴とする多資源システムスケジューリ
ング方式。
[Claims] In a multi-resource system scheduling method that automatically performs scheduling to allocate processing tasks to resources in a processing system that has a plurality of resources and performs processing, at the beginning of scheduling, the processing tasks are allocated to the plurality of resources on average. a processing task exchange resource selection means for selecting two resources for exchanging processing tasks; and one of the processing tasks allocated to both resources selected by the processing task exchange resource selection means. processing task exchange evaluation means for calculating the evaluation values of both resources after exchanging each resource; and evaluation values of both resources selected by the processing task exchange resource selection means based on the evaluation values obtained by the processing task exchange evaluation means. A processing task exchange means that selects and actually exchanges the processing tasks that minimize the difference between the processing tasks, and a resource selection means that is performed after the processing by the processing task exchange means and the resource selection means is effective. 1. A multi-resource system scheduling method, comprising: resource selection evaluation means for evaluating whether or not.
JP2302930A 1990-11-08 1990-11-08 Multi-resouce system scheduling system Pending JPH04177457A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2302930A JPH04177457A (en) 1990-11-08 1990-11-08 Multi-resouce system scheduling system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2302930A JPH04177457A (en) 1990-11-08 1990-11-08 Multi-resouce system scheduling system

Publications (1)

Publication Number Publication Date
JPH04177457A true JPH04177457A (en) 1992-06-24

Family

ID=17914846

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2302930A Pending JPH04177457A (en) 1990-11-08 1990-11-08 Multi-resouce system scheduling system

Country Status (1)

Country Link
JP (1) JPH04177457A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110688204A (en) * 2019-08-08 2020-01-14 平安科技(深圳)有限公司 Distributed computing system task allocation method and related equipment

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110688204A (en) * 2019-08-08 2020-01-14 平安科技(深圳)有限公司 Distributed computing system task allocation method and related equipment
CN110688204B (en) * 2019-08-08 2022-08-26 平安科技(深圳)有限公司 Distributed computing system task allocation method and related equipment

Similar Documents

Publication Publication Date Title
US7079266B1 (en) Printshop resource optimization via the use of autonomous cells
Gong et al. Performance modeling and prediction of nondedicated network computing
US6487455B1 (en) Distributed real time operating system
WO2015117565A1 (en) Methods and systems for dynamically allocating resources and tasks among database work agents in smp environment
JP3541212B2 (en) Processor assignment device
CN113886034A (en) Task scheduling method, system, electronic device and storage medium
Bhaskar et al. Static and dynamic operator allocation problems in cellular manufacturing systems
US20040093477A1 (en) Scalable parallel processing on shared memory computers
KR102029378B1 (en) Manufacturing Scheduling System
CN103440113A (en) Disk IO (Input/output) resource allocation method and device
CN107766144A (en) A kind of method for scheduling task, apparatus and system
Ramamritham et al. Issues in the static allocation and scheduling of complex periodic tasks
Yadav et al. A fuzzy clustering method to minimize the inter task communication effect for optimal utilization of processor’s capacity in distributed real time systems
KR100590764B1 (en) Method for mass data processing through scheduler in multi processor system
Ren et al. Interval job scheduling with machine launch cost
CN109189581B (en) Job scheduling method and device
CN106874129A (en) A kind of operating system process scheduling order determines method and control method
JPH04177457A (en) Multi-resouce system scheduling system
Benjaafar Machine sharing in cellular manufacturing systems
Mohamed A flexible approach to (re) configure flexible manufacturing cells
Sim et al. Simulation of a multi-agent protocol for task allocation in cooperative design
JPH1069402A (en) Automatic test control method for software
JPH0496141A (en) Two resources system scheduling system
CN114584567B (en) Block chain-based batch operation processing method and device
Jayakumar et al. An Heuristic approach for solving OSSP with the objective of minimizing the Total Completion Time