JP2009098924A5 - - Google Patents
Download PDFInfo
- Publication number
- JP2009098924A5 JP2009098924A5 JP2007269705A JP2007269705A JP2009098924A5 JP 2009098924 A5 JP2009098924 A5 JP 2009098924A5 JP 2007269705 A JP2007269705 A JP 2007269705A JP 2007269705 A JP2007269705 A JP 2007269705A JP 2009098924 A5 JP2009098924 A5 JP 2009098924A5
- Authority
- JP
- Japan
- Prior art keywords
- raw material
- constraint condition
- vector
- objective function
- products
- 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.)
- Granted
Links
- 239000002994 raw material Substances 0.000 claims 53
- 239000011159 matrix material Substances 0.000 claims 18
- 238000000034 method Methods 0.000 claims 6
- 230000000875 corresponding Effects 0.000 claims 5
- 230000001276 controlling effect Effects 0.000 claims 2
Claims (7)
求められているｍ本の製品の製品長データの入力を受け付けて、製品長を要素とするｍ次の製品長ベクトルLpと、製品要求数量を要素とする製品要求数量ベクトルｂとを生成して、記憶装置に記憶させる製品長設定手段と、
用意されたｋ種類の長さの原材料長データの入力を受け付けて、原材料長を要素とするｋ次の原材料長ベクトルLmを生成し、記憶装置に記憶させる原材料長設定手段と、
求められている前記ｍ本の製品の製品長データと用意された前記ｋ種類の原材料の原材料長データとを比較して、１本または複数本の製品を経済的に割り付けることができる原材料と製品との関係を示す、ｍ次の割付パターンベクトルを列挙する割付パターンベクトル生成手段と、
前記割付パターンベクトル生成手段の生成した割付パターンベクトルを並べた割付パターン行列Ａを生成して、記憶装置に記憶させる割付パターン行列生成手段と、
前記割付パターン行列に含まれたｎ個の割付パターンから選択して該当する原材料を選択する要素がｘiの使用本数ベクトルｘを定義し、前記原材料長ベクトルLmに対応するｍ次の費用係数ベクトルと前記使用本数ベクトルｘの積の総和を示す目的関数を生成して、記憶装置に記憶させる目的関数生成手段と、
前記割付パターン行列Ａから選択されたｎ個の割付パターンで切り出した各製品数は、それぞれ求められている各製品の数量以上でなければならないとする第１制約条件式Ａｘ≧ｂと緩和された第３制約条件式０≦ｘi≦１を生成して、記憶装置に記憶させる制約条件生成手段と、
任意の方法で求められた初期実行可能解の入力を受け付けて、記憶装置に記憶させる初期設定手段と、
前記初期実行可能解と前記目的関数と前記制約条件式の入力を受け付けて、シンプレックス演算処理を実行するシンプレックス演算手段と、
前記シンプレックス演算処理により、ｘiの値が０または１のいずれかであって、それ以外のものを含まない解のときは、その解を最適解として部材割付データを出力し、それ以外の場合には、前記初期実行可能解の目的関数の値を最大値とし、前記シンプレックス演算処理の結果得られた目的関数の値を最小値として、その範囲の目的関数の値をとる原材料の使用本数の組合せを列挙し、その中から目的関数が前記最小値に近いものを選択して、前記制約条件生成手段に対して、どの長さの原材料を何本選択して割付けに使用するかを定める、原材料使用行列Ｃと原材料の使用本数ベクトルｘの積が原材料使用予定数量ベクトルｄと等しいとする第２制約条件式Ｃｘ＝ｄの生成を依頼し、前記第１制約条件式と前記第２制約条件式と前記第３制約条件式の制約条件下で、シンプレックス演算手段に演算処理を依頼し、その後得られたシンプレックス演算処理により、ｘiの値が０または１のいずれかであって、それ以外のものを含まない解のときは、その解を最適解として部材割付データを出力し、それ以外の場合には、列挙された前記原材料の使用本数の組合せの中から、目的関数が前記最小値に近い次の候補を選択して、前記制約条件生成手段に対して、新たな第２制約条件式Ｃｘ＝ｄの生成を依頼し、この新たな制約条件で、シンプレックス演算手段に演算処理を依頼するという動作を繰り返すように制御する探索制御手段を備えたことを特徴とする部材割付システム。 The number of each type of raw material required when each of m products of a predetermined length is cut out from k types of raw materials of a predetermined length, and the combination of products assigned to each raw material is optimized. There,
Accepting the input of product length data of m required products, and generating an m-th order product length vector Lp having the product length as an element and a product request quantity vector b having the product request quantity as an element Product length setting means for storing in the storage device;
A raw material length setting means that receives input of raw material length data of k types of prepared lengths, generates a k-th order raw material length vector Lm having the raw material length as an element, and stores it in a storage device;
The raw material and product which can economically allocate one or a plurality of products by comparing the product length data of the required m products with the raw material length data of the k kinds of raw materials prepared An allocation pattern vector generating means for enumerating m-th order allocation pattern vectors,
An allocation pattern matrix generation unit that generates an allocation pattern matrix A in which the allocation pattern vectors generated by the allocation pattern vector generation unit are arranged and stores the allocation pattern matrix A in a storage device;
An element for selecting a corresponding raw material by selecting from n allocation patterns included in the allocation pattern matrix defines a use number vector x of x i, and an m-th order cost coefficient vector corresponding to the raw material length vector Lm; An objective function generating means for generating an objective function indicating a sum of products of the used number vectors x and storing the objective function in a storage device;
The number of products cut out by n allocation patterns selected from the allocation pattern matrix A has been relaxed as a first constraint condition Ax ≧ b, which must be equal to or greater than the quantity of each required product . A constraint condition generation means for generating a third constraint condition expression 0 ≦ xi ≦ 1 and storing it in the storage device;
Initial setting means for receiving an input of an initial executable solution obtained by an arbitrary method and storing it in a storage device;
Simplex operation means for receiving input of the initial executable solution, the objective function, and the constraint condition expression, and executing simplex operation processing;
If the simplex operation process results in a solution where the value of xi is either 0 or 1 and does not include any other value , the member assignment data is output with the solution as the optimal solution, otherwise Is a combination of the number of raw materials used that takes the objective function value of the initial feasible solution as a maximum value, the objective function value obtained as a result of the simplex operation processing as a minimum value, and takes the objective function value in that range. Are selected from among them, and the number of raw materials of which length is selected and used for allocation is selected for the constraint condition generation means. A request is made to generate a second constraint condition expression Cx = d, where the product of the use matrix C and the raw material use number vector x is equal to the raw material use scheduled quantity vector d, and the first constraint condition expression and the second constraint condition expression are requested. And the third Under the constraint condition of the constraint condition expression, the simplex operation means is requested to perform the arithmetic processing, and the simplex arithmetic processing obtained thereafter results in a solution where the value of xi is either 0 or 1 and does not include any other In this case, the member allocation data is output with the solution as an optimal solution, and in other cases, the next candidate whose objective function is close to the minimum value is selected from the listed combinations of the number of raw materials used. Select and request the constraint condition generation means to generate a new second constraint condition expression Cx = d, and repeat the operation of requesting the simplex operation means to perform arithmetic processing under this new constraint condition. A member allocation system comprising search control means for controlling the member.
探索制御手段は、２回目以降のシンプレックス演算処理の繰り返し回数に上限値を設けることを特徴とする部材割付システム。 In the member allocation system according to claim 1 ,
The search control means provides an upper limit value for the number of repetitions of the second and subsequent simplex operation processes.
求められているｍ本の製品の製品長データの入力を受け付けて、製品長を要素とするｍ次の製品長ベクトルLpと、製品要求数量を要素とする製品要求数量ベクトルｂとを生成して、記憶装置に記憶させる製品長設定手段と、
用意されたｋ種類の長さの原材料長データの入力を受け付けて、原材料長を要素とするｋ次の原材料長ベクトルLmを生成し、記憶装置に記憶させる原材料長設定手段と、
求められている前記ｍ本の製品の製品長データと用意された前記ｋ種類の原材料の原材料長データとを比較して、１本または複数本の製品を経済的に割り付けることができる原材料と製品との関係を示す、ｍ次の割付パターンベクトルを列挙する割付パターンベクトル生成手段と、
前記割付パターンベクトル生成手段の生成した割付パターンベクトルを並べた割付パターン行列Ａを生成して、記憶装置に記憶させる割付パターン行列生成手段と、
前記割付パターン行列に含まれたｎ個の割付パターンから選択して該当する原材料を選択する要素がｘiの使用本数ベクトルｘを定義し、前記原材料長ベクトルLmに対応するｍ次の費用係数ベクトルと前記使用本数ベクトルｘの積の総和を示す目的関数を生成して、記憶装置に記憶させる目的関数生成手段と、
前記割付パターン行列Ａから選択されたｎ個の割付パターンで切り出した各製品数は、それぞれ求められている各製品の数量以上でなければならないとする第１制約条件式Ａｘ≧ｂと緩和された第３制約条件式０≦ｘi≦１を生成して、記憶装置に記憶させる制約条件生成手段と、
任意の方法で求められた初期実行可能解の入力を受け付けて、記憶装置に記憶させる初期設定手段と、
前記初期実行可能解と前記目的関数と前記制約条件式の入力を受け付けて、シンプレックス演算処理を実行するシンプレックス演算手段と、
前記シンプレックス演算処理により、ｘiの値が０または１のいずれかであって、それ以外のものを含まない解のときは、その解を最適解として部材割付データを出力し、それ以外の場合には、前記初期実行可能解の目的関数の値を最大値とし、前記シンプレックス演算処理の結果得られた目的関数の値を最小値として、その範囲の目的関数の値をとる原材料の使用本数の組合せを列挙し、その中から目的関数が前記最小値に近いものを選択して、前記制約条件生成手段に対して、どの長さの原材料を何本選択して割付けに使用するかを定める、原材料使用行列Ｃと原材料の使用本数ベクトルｘの積が原材料使用予定数量ベクトルｄと等しいとする第２制約条件式Ｃｘ＝ｄの生成を依頼し、前記第１制約条件式と前記第２制約条件式と前記第３制約条件式の制約条件下で、シンプレックス演算手段に演算処理を依頼し、その後得られたシンプレックス演算処理により、ｘiの値が０または１のいずれかであって、それ以外のものを含まない解のときは、その解を最適解として部材割付データを出力し、それ以外の場合には、列挙された前記原材料の使用本数の組合せの中から、目的関数が前記最小値に近い次の候補を選択して、前記制約条件生成手段に対して、新たな第２制約条件式Ｃｘ＝ｄの生成を依頼し、この新たな制約条件で、シンプレックス演算手段に演算処理を依頼するという動作を繰り返すように制御する探索制御手段を備えたことを特徴とする部材加工装置。 Means for optimizing the combination of products assigned to each raw material by obtaining the number of each type of raw material required when each of m products having a predetermined length is cut out from k kinds of raw materials each having a predetermined length; A pre-cut device that accepts optimized member allocation data and cuts the m products from the k kinds of raw materials that are sequentially supplied;
Accepting the input of product length data of m required products, and generating an m-th order product length vector Lp having the product length as an element and a product request quantity vector b having the product request quantity as an element Product length setting means for storing in the storage device;
A raw material length setting means that receives input of raw material length data of k types of prepared lengths, generates a k-th order raw material length vector Lm having the raw material length as an element, and stores it in a storage device;
The raw material and product which can economically allocate one or a plurality of products by comparing the product length data of the required m products with the raw material length data of the k kinds of raw materials prepared An allocation pattern vector generating means for enumerating m-th order allocation pattern vectors,
An allocation pattern matrix generation unit that generates an allocation pattern matrix A in which the allocation pattern vectors generated by the allocation pattern vector generation unit are arranged and stores the allocation pattern matrix A in a storage device;
An element for selecting a corresponding raw material by selecting from n allocation patterns included in the allocation pattern matrix defines a use number vector x of x i, and an m-th order cost coefficient vector corresponding to the raw material length vector Lm; An objective function generating means for generating an objective function indicating a sum of products of the used number vectors x and storing the objective function in a storage device;
The number of products cut out by n allocation patterns selected from the allocation pattern matrix A has been relaxed as a first constraint condition Ax ≧ b, which must be equal to or greater than the quantity of each required product . A constraint condition generation means for generating a third constraint condition expression 0 ≦ xi ≦ 1 and storing it in the storage device;
Initial setting means for receiving an input of an initial executable solution obtained by an arbitrary method and storing it in a storage device;
Simplex operation means for receiving input of the initial executable solution, the objective function, and the constraint condition expression, and executing simplex operation processing;
If the simplex operation process results in a solution where the value of xi is either 0 or 1 and does not include any other value , the member assignment data is output with the solution as the optimal solution, otherwise Is a combination of the number of raw materials used that takes the objective function value of the initial feasible solution as a maximum value, the objective function value obtained as a result of the simplex operation processing as a minimum value, and takes the objective function value in that range. Are selected from among them, and the number of raw materials of which length is selected and used for allocation is selected for the constraint condition generation means. A request is made to generate a second constraint condition expression Cx = d, where the product of the use matrix C and the raw material use number vector x is equal to the raw material use scheduled quantity vector d, and the first constraint condition expression and the second constraint condition expression are requested. And the third Under the constraint condition of the constraint condition expression, the simplex operation means is requested to perform the arithmetic processing, and the simplex arithmetic processing obtained thereafter results in a solution where the value of xi is either 0 or 1 and does not include any other In this case, the member allocation data is output with the solution as an optimal solution, and in other cases, the next candidate whose objective function is close to the minimum value is selected from the listed combinations of the number of raw materials used. Select and request the constraint condition generation means to generate a new second constraint condition expression Cx = d, and repeat the operation of requesting the simplex operation means to perform arithmetic processing under this new constraint condition. A member processing apparatus comprising a search control means for controlling the apparatus.
探索制御手段は、２回目以降のシンプレックス演算処理の繰り返し回数に上限値を設けることを特徴とする部材加工装置。 The member processing apparatus, wherein the search control means sets an upper limit value for the number of repetitions of the second and subsequent simplex operations.
製品長設定手段が、求められているｍ本の製品の製品長データの入力を受け付けて、製品長を要素とするｍ次の製品長ベクトルLpと、製品要求数量を要素とする製品要求数量ベクトルｂとを生成して、記憶装置に記憶させるステップと、
原材料長設定手段が、用意されたｋ種類の長さの原材料長データの入力を受け付けて、原材料長を要素とするｋ次の原材料長ベクトルLmを生成し、記憶装置に記憶させるステップと、
割付パターンベクトル生成手段が、求められている前記ｍ本の製品の製品長データと用意された前記ｋ種類の原材料の原材料長データとを比較して、１本または複数本の製品を経済的に割り付けることができる原材料と製品との関係を示す、ｍ次の割付パターンベクトルを列挙するステップと、
割付パターン行列生成手段が、前記割付パターンベクトル生成手段の生成した割付パターンベクトルを並べた割付パターン行列Ａを生成して、記憶装置に記憶させるステップと、
目的関数生成手段が、前記割付パターン行列に含まれたｎ個の割付パターンをから選択して該当する原材料を選択する要素がｘiの使用本数ベクトルｘを定義し、前記原材料長ベクトルLmに対応するｍ次の費用係数ベクトルと前記使用本数ベクトルｘの積の総和を示す目的関数を生成して、記憶装置に記憶させるステップと、
制約条件生成手段が、前記割付パターン行列Ａから選択されたｎ個の割付パターンで切り出した各製品数は、それぞれ求められている各製品の数量以上でなければならないとする第１制約条件式Ａｘ≧ｂと緩和された第３制約条件式０≦ｘi≦１を生成して、記憶装置に記憶させるステップと、
初期設定手段が、任意の方法で求められた初期実行可能解の入力を受け付けて、記憶装置に記憶させるステップと、
シンプレックス演算手段が、前記初期実行可能解と前記目的関数と前記制約条件式の入力を受け付けて、シンプレックス演算処理を実行するステップと、
探索制御手段が、前記シンプレックス演算処理により、ｘiの値が０または１のいずれかであって、それ以外のものを含まない解のときは、その解を最適解として部材割付データを出力し、それ以外の場合には、前記初期実行可能解の目的関数の値を最大値とし、前記シンプレックス演算処理の結果得られた目的関数の値を最小値として、その範囲の目的関数の値をとる原材料の使用本数の組合せを列挙し、その中から目的関数が前記最小値に近いものを選択するステップと、
前記探索制御手段が、前記制約条件生成手段に対して、どの長さの原材料を何本選択して割付けに使用するかを定める、原材料使用行列Ｃと原材料の使用本数ベクトルｘの積が原材料使用予定数量ベクトルｄと等しいとする第２制約条件式Ｃｘ＝ｄの生成を依頼するステップと、
前記探索制御手段が、前記第１制約条件式と前記第２制約条件式と前記第３制約条件式の制約条件下で、シンプレックス演算手段に演算処理を依頼するステップと、
前記探索制御手段が、その後得られたシンプレックス演算処理により、ｘiの値が０または１のいずれかであって、それ以外のものを含まない解のときは、その解を最適解として部材割付データを出力し、それ以外の場合には、列挙された前記原材料の使用本数の組合せの中から、目的関数が前記最小値に近い次の候補を選択して、前記制約条件生成手段に対して、新たな第２制約条件式Ｃｘ＝ｄの生成を依頼し、この新たな制約条件で、シンプレックス演算手段に演算処理を依頼するという動作を繰り返すように制御するステップを含むことを特徴とする部材割付方法。 A method that optimizes the combination of products assigned to each raw material by obtaining the number of each type of raw material required when cutting out m products each having a predetermined length from k kinds of raw materials each having a predetermined length. There,
The product length setting means accepts the input of the product length data of m required products, and the m-th order product length vector Lp with the product length as an element and the product request quantity vector with the product request quantity as an element generating b and storing it in a storage device;
A step in which raw material length setting means receives input of raw material length data of k types of prepared lengths, generates a k-th raw material length vector Lm having the raw material length as an element, and stores it in a storage device;
The allocation pattern vector generation means compares the required product length data of the m products and the prepared raw material length data of the k kinds of raw materials, and economically determines one or more products. Enumerating m-th order allocation pattern vectors indicating the relationship between raw materials and products that can be allocated;
An allocation pattern matrix generation unit that generates an allocation pattern matrix A in which the allocation pattern vectors generated by the allocation pattern vector generation unit are arranged and stores the allocation pattern matrix A in a storage device;
The objective function generation means selects n allocation patterns included in the allocation pattern matrix and selects a corresponding raw material, defines an used number vector x of xi, and corresponds to the raw material length vector Lm. generating an objective function indicating a sum of products of m-th order cost coefficient vectors and the used number vectors x and storing the objective function in a storage device;
The first constraint condition expression Ax that the number of products cut out by the constraint condition generation means with the n number of allocation patterns selected from the allocation pattern matrix A must be equal to or greater than the quantity of each product that is determined. Generating a third constraint condition 0 ≦ xi ≦ 1 relaxed as ≧ b and storing it in the storage device;
An initial setting means for receiving an input of an initial executable solution obtained by an arbitrary method and storing it in a storage device;
A simplex computing means for receiving input of the initial executable solution, the objective function, and the constraint expression, and executing a simplex computing process;
The search control means outputs a member allocation data with the solution as the optimal solution when the value of xi is either 0 or 1 and does not include any other by the simplex operation processing, In other cases, the raw material which takes the value of the objective function in the range with the value of the objective function of the initial feasible solution as the maximum value and the value of the objective function obtained as a result of the simplex operation processing as the minimum value. Enumerating the combinations of the number of used and selecting the one whose objective function is close to the minimum value from among the combinations,
The search control means determines how many raw materials of which length to select and use for allocation to the constraint generation means. The product of the raw material use matrix C and the raw material use number vector x is the raw material use. Requesting generation of a second constraint condition expression Cx = d that is equal to the planned quantity vector d ;
The search control means requesting a simplex computing means to perform arithmetic processing under the constraint conditions of the first constraint condition expression, the second constraint condition expression, and the third constraint condition expression ;
When the search control means obtains a simplex operation process , and the solution is a solution that does not include any other value when the value of xi is 0 or 1, member assignment data is determined with that solution as the optimum solution. Otherwise, select the next candidate whose objective function is close to the minimum value from the listed combinations of the number of used raw materials , and A member assignment comprising: a step of requesting the generation of a new second constraint condition expression Cx = d, and a control to repeat the operation of requesting a calculation process to the simplex operation means under the new constraint condition Method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2007269705A JP4909869B2 (en) | 2007-10-17 | 2007-10-17 | Material assignment system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2007269705A JP4909869B2 (en) | 2007-10-17 | 2007-10-17 | Material assignment system |
Publications (3)
| Publication Number | Publication Date |
|---|---|
| JP2009098924A JP2009098924A (en) | 2009-05-07 |
| JP2009098924A5 true JP2009098924A5 (en) | 2010-04-02 |
| JP4909869B2 JP4909869B2 (en) | 2012-04-04 |
Family
ID=40701870
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP2007269705A Active JP4909869B2 (en) | 2007-10-17 | 2007-10-17 | Material assignment system |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JP4909869B2 (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5000735B2 (en) * | 2010-02-16 | 2012-08-15 | 住友林業株式会社 | Material assignment system |
| JP5838047B2 (en) * | 2011-06-13 | 2015-12-24 | 株式会社トーアエンジニアリング | Material assignment system |
| JP5983976B1 (en) * | 2016-01-18 | 2016-09-06 | 株式会社Ｊｌｓ | Member assignment system, member assignment program, recording medium and member processing apparatus |
| JP2019148924A (en) * | 2018-02-26 | 2019-09-05 | 株式会社ア−キテック | Device and program for planning cutting-out of reinforcing bar |
| CN116868220A (en) * | 2021-02-22 | 2023-10-10 | 松下知识产权经营株式会社 | Production process output device, production process output method, and program |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5216593A (en) * | 1991-01-24 | 1993-06-01 | International Business Machines Corporation | Method and apparatus for discrete activity resourse allocation through cardinality constraint generation |
| JPH04365162A (en) * | 1991-06-13 | 1992-12-17 | Matsushita Electric Ind Co Ltd | Analyzing method and scheduling method of resource allocation and systems therefor |
| US5630070A (en) * | 1993-08-16 | 1997-05-13 | International Business Machines Corporation | Optimization of manufacturing resource planning |
| JP3039348B2 (en) * | 1995-12-27 | 2000-05-08 | 住友金属工業株式会社 | Production planning method and board removal method |
| JPH1139384A (en) * | 1997-07-22 | 1999-02-12 | Sumitomo Metal Ind Ltd | Combination problem solving method, planning method and recording medium |
| US6341266B1 (en) * | 1998-06-19 | 2002-01-22 | Sap Aktiengesellschaft | Method and system for the maximization of the range of coverage profiles in inventory management |
| JP2000067028A (en) * | 1998-08-24 | 2000-03-03 | Sumitomo Metal Ind Ltd | Method for generating schedule and record medium |
| JP3565262B2 (en) * | 1999-09-20 | 2004-09-15 | 住友林業株式会社 | Member allocation method and member allocation processing device |
| JP2001168682A (en) * | 1999-12-13 | 2001-06-22 | Jeol Ltd | Digital filter |
| JP2004239519A (en) * | 2003-02-06 | 2004-08-26 | Yamaguchi Technology Licensing Organization Ltd | Controller of heat storage plant |
| JP2005322960A (en) * | 2004-05-06 | 2005-11-17 | National Univ Corp Shizuoka Univ | Color conversion method for multi-primary color display apparatus |
-
2007
- 2007-10-17 JP JP2007269705A patent/JP4909869B2/en active Active
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6983154B2 (en) | Processing graphs | |
| Chin et al. | A learning-rate schedule for stochastic gradient methods to matrix factorization | |
| Alagöz et al. | Rescheduling of identical parallel machines under machine eligibility constraints | |
| Cheng et al. | Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity | |
| JP2009098924A5 (en) | ||
| Pooranian et al. | New hybrid algorithm for task scheduling in grid computing to decrease missed task | |
| Rudek | The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model | |
| Shen et al. | Flow shop batching and scheduling with sequence-dependent setup times | |
| İşler et al. | Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect | |
| Rustogi et al. | Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance | |
| Agarwal et al. | Active learning-based automatic tuning and prediction of parallel i/o performance | |
| Rudek | On single processor scheduling problems with learning dependent on the number of processed jobs | |
| Sheremetov et al. | Two-stage genetic algorithm for parallel machines scheduling problem: Cyclic steam stimulation of high viscosity oil reservoirs | |
| CN113037800A (en) | Job scheduling method and job scheduling device | |
| JP5838047B2 (en) | Material assignment system | |
| JP6470209B2 (en) | Server, system, and search method | |
| US20180039514A1 (en) | Methods and apparatus to facilitate efficient scheduling of digital tasks in a system | |
| JP4909869B2 (en) | Material assignment system | |
| CN115689246A (en) | Method, device, storage medium and processor for determining scheduling plan | |
| JP5000735B2 (en) | Material assignment system | |
| Hidri et al. | Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect | |
| CN108268316A (en) | The method and device of job scheduling | |
| JP6172145B2 (en) | Parallel allocation optimization device, parallel allocation optimization method, and parallel allocation optimization program | |
| Rudek | Parallel machine scheduling with general sum of processing time based models | |
| CN104011682B (en) | The method and computer system of predictive treatment are carried out to application affairs response |