IMPROVED OPTIMAL-ALGORITHMS FOR SCHEDULING UNIT-LENGTH INDEPENDENT TASKS ON UNIFORM MACHINES

TRIANTAFYLLAKIS, A; TZAFESTAS, S

dc.contributor.author	TRIANTAFYLLAKIS, A	en
dc.contributor.author	TZAFESTAS, S	en
dc.date.accessioned	2014-03-01T01:09:54Z
dc.date.available	2014-03-01T01:09:54Z
dc.date.issued	1994	en
dc.identifier.issn	0020-7721	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11246
dc.subject	Optimal Algorithm	en
dc.subject.classification	Automation & Control Systems	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	RESOURCE CONSTRAINTS	en
dc.subject.other	PROCESSORS	en
dc.title	IMPROVED OPTIMAL-ALGORITHMS FOR SCHEDULING UNIT-LENGTH INDEPENDENT TASKS ON UNIFORM MACHINES	en
heal.type	journalArticle	en
heal.identifier.primary	10.1080/00207729408928982	en
heal.identifier.secondary	http://dx.doi.org/10.1080/00207729408928982	en
heal.language	English	en
heal.publicationDate	1994	en
heal.abstract	Five scheduling problems are considered, concerning unit-length independent tasks and uniform machines. New improved optimal algorithms are presented that can solve these problems in at most O(n log n) time, where n is the number of tasks. The existing algorithms solve most of these problems in O(n3) time. Proofs of optimality of the present algorithms are included, and simple representative examples are provided that illustrate the type of results obtained.	en
heal.publisher	TAYLOR & FRANCIS LTD	en
heal.journalName	INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE	en
dc.identifier.doi	10.1080/00207729408928982	en
dc.identifier.isi	ISI:A1994NE64400014	en
dc.identifier.volume	25	en
dc.identifier.issue	3	en
dc.identifier.spage	591	en
dc.identifier.epage	601	en