| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 739 3 |
| Ultima descărcare din IBN: 2023-02-19 11:16 |
| Căutarea după subiecte similare conform CZU |
| 004.896:519.81 (1) |
| Искусственный интеллект (303) |
| Исследование операций (168) |
 SM ISO690:2012BOLUN, Ion. Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem. In: Computer Science Journal of Moldova, 2007, nr. 1(43), pp. 88-110. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(43) / 2007 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.896:519.81 | ||||||
| Pag. 88-110 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Bellman-Johnson Mxn scheduling problem with monotone (no decreasing, constant or no increasing) jobs of three different pro cessing times is investigated. Three different classes C3.1, C3.2 and C3.3 of such systems are considered. On the basis of earlier results, the solution for optimal ordering of adjacent or nonadja- cent jobs in pairs for each of these classes of systems is obtained. In addition, examples of systems for which it is possible to obtain the optimal solution of ordering all n jobs are done, too. |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-2415</cfResPublId> <cfResPublDate>2007-01-05</cfResPublDate> <cfVol>43</cfVol> <cfIssue>1</cfIssue> <cfStartPage>88</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/2415</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem</cfTitle> <cfAbstr cfLangCode='EN' cfTrans='o'>Bellman-Johnson Mxn scheduling problem with monotone (no decreasing, constant or no increasing) jobs of three different pro cessing times is investigated. Three different classes C3.1, C3.2 and C3.3 of such systems are considered. On the basis of earlier results, the solution for optimal ordering of adjacent or nonadja- cent jobs in pairs for each of these classes of systems is obtained. In addition, examples of systems for which it is possible to obtain the optimal solution of ordering all n jobs are done, too.</cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2007-01-05T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2007-01-05T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-13093</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2007-01-05T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-13093</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-13093-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2007-01-05T24:00:00</cfStartDate> <cfFamilyNames>Bolun</cfFamilyNames> <cfFirstNames>Ion</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>
|
|
|
