| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 629 0 |
 SM ISO690:2012BOLUN, Ion. Ordonarea lucrărilor monotone în problema Mxn Bellman-Johnson
. In: Economica, 2007, nr. 1(57), pp. 103-108. ISSN 1810-9136. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Economica | ||||||
| Numărul 1(57) / 2007 / ISSN 1810-9136 | ||||||
|
||||||
| Pag. 103-108 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Bellman-Johnson’s Mxn scheduling problem with monotone (no decreasing, constant or no increasing) jobs is investigated. Rules for optimal ordering of monotone jobs in the schedule, which contain no monotone jobs too, are proposed. Partial ordering of jobs permits to reduce the volume of calculus and often to improve the quasi optimal schedules. If all n jobs are monotone, particular cases are defined and rules for optimal schedules are proposed. |
||||||
|
|
|
|
