An optimal scheduling algorithm for minimizing the maximum weighted lateness of unit-length independent tasks

Tzafestas, S; Triantafyllakis, A

dc.contributor.author	Tzafestas, S	en
dc.contributor.author	Triantafyllakis, A	en
dc.date.accessioned	2014-03-01T01:09:18Z
dc.date.available	2014-03-01T01:09:18Z
dc.date.issued	1993	en
dc.identifier.issn	0166-3615	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10883
dc.subject	Optimal schedule	en
dc.subject	Scheduling	en
dc.subject	Task lateness	en
dc.subject	Task weight	en
dc.subject	Unit-length tasks	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.other	Algorithms	en
dc.subject.other	Constraint theory	en
dc.subject.other	Optimal systems	en
dc.subject.other	Optimization	en
dc.subject.other	Maximum weighted lateness	en
dc.subject.other	Task weight	en
dc.subject.other	Unit length tasks	en
dc.subject.other	Scheduling	en
dc.title	An optimal scheduling algorithm for minimizing the maximum weighted lateness of unit-length independent tasks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0166-3615(93)90095-I	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0166-3615(93)90095-I	en
heal.language	English	en
heal.publicationDate	1993	en
heal.abstract	Scheduling problems deal with the assignment of tasks to machines, over time, so as to optimize a performance criterion while satisfying some constraints. In this paper a new optimality criterion to be minimized is introduced, viz. the ""maximum weighted lateness"" (Lw), Which is a significant extension of the well known ""maximum lateness"" criterion. It is shown that, under the conditionoof unit-length independent nonpre-emptive tasks and identical or uniform machines, an optimal schedule with respect to the criterion Lw can always be found in O(n3) time. The associated optimal scheduling algorithm in pseudo-code and an illustrative example are also presented. © 1993.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computers in Industry	en
dc.identifier.doi	10.1016/0166-3615(93)90095-I	en
dc.identifier.isi	ISI:A1993ME56200005	en
dc.identifier.volume	22	en
dc.identifier.issue	3	en
dc.identifier.spage	283	en
dc.identifier.epage	289	en