Ordering of jobs with tree different processing times in the MXN Bellman-Jonson problem

BOLUN, Ion

dc.contributor.author	BOLUN, Ion
dc.date.accessioned	2021-12-02T12:02:53Z
dc.date.available	2021-12-02T12:02:53Z
dc.date.issued	2007
dc.identifier.citation	BOLUN, Ion. Ordering of jobs with tree different processing times in the MXN Bellman-Jonson problem. In: Computer Science Journal of Moldova. 2007, N. 1(43), pp. 88-110. ISSN 1561-4042.	en_US
dc.identifier.issn	1561-4042
dc.identifier.uri	http://repository.utm.md/handle/5014/18247
dc.description.abstract	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 nonadjacent 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.	en_US
dc.language.iso	en	en_US
dc.publisher	Institutul de Matematică şi Informatică al AŞM	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	scheduling problems	en_US
dc.subject	monotone jobs	en_US
dc.title	Ordering of jobs with tree different processing times in the MXN Bellman-Jonson problem	en_US
dc.type	Article	en_US