Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem
Close
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
731 3
Ultima descărcare din IBN:
2023-02-19 11:16
Căutarea după subiecte
similare conform CZU
004.896:519.81 (1)
Artificial intelligence (302)
Operational research (OR): mathematical theories and methods (168)
SM ISO690:2012
BOLUN, 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

Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem
CZU: 004.896:519.81

Pag. 88-110

Bolun Ion
 
Academy of Economic Studies of Moldova
 
 
Disponibil în IBN: 14 decembrie 2013


Rezumat

Bellman-Johnson Mxn scheduling problem with monotone (no decreasing, constant or no increasing) jobs of three different processing 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.

Crossref XML Export

<?xml version='1.0' encoding='utf-8'?>
<doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'>
<head>
<doi_batch_id>ibn-2415</doi_batch_id>
<timestamp>1713249719</timestamp>
<depositor>
<depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name>
<email_address>idsi@asm.md</email_address>
</depositor>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Computer Science Journal of Moldova</full_title>
<issn media_type='print'>15614042</issn>
</journal_metadata>
<journal_issue>
<publication_date media_type='print'>
<year>2007</year>
</publication_date>
<issue>1(43)</issue>
</journal_issue>
<journal_article publication_type='full_text'><titles>
<title>Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem</title>
</titles>
<contributors>
<person_name sequence='first' contributor_role='author'>
<given_name>Ion</given_name>
<surname>Bolun</surname>
</person_name>
</contributors>
<publication_date media_type='print'>
<year>2007</year>
</publication_date>
<pages>
<first_page>88</first_page>
<last_page>110</last_page>
</pages>
</journal_article>
</journal>
</body>
</doi_batch>