A new adaptively weighted combinatorial dispatching rule for complex scheduling problems

Tzafestas, S; Triantafyllakis, A

dc.contributor.author	Tzafestas, S	en
dc.contributor.author	Triantafyllakis, A	en
dc.date.accessioned	2014-03-01T01:09:40Z
dc.date.available	2014-03-01T01:09:40Z
dc.date.issued	1994	en
dc.identifier.issn	0951-5240	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11134
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-38149143913&partnerID=40&md5=1d56657fa385efd20856b7dba4db7fd5	en
dc.subject	AWCD rule	en
dc.subject	combinatorial dispatching	en
dc.subject	scheduling problems	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Engineering, Manufacturing	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	APPROXIMATION	en
dc.subject.other	SYSTEMS	en
dc.title	A new adaptively weighted combinatorial dispatching rule for complex scheduling problems	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1994	en
heal.abstract	In this paper, a new adaptively weighted combinatorial dispatching (AWCD) rule is developed which is appropriate for complex scheduling problems with multiple and conflicting criteria. This rule identifies the constraints that are most tight, and adaptively estimates the tightness of each constraint. Previous combinatorial dispatching rules appear as special cases of the AWCD rule. An illustrative small-scale scheduling example is provided, which shows the applicability of the AWCD rule to practical problems. Statistical results obtained using 200 random scheduling problems showed the superiority of the AWCD rule over six other composite or combinatorial rules. © 1994.	en
heal.publisher	BUTTERWORTH-HEINEMANN LTD	en
heal.journalName	Computer Integrated Manufacturing Systems	en
dc.identifier.isi	ISI:A1994MV69800002	en
dc.identifier.volume	7	en
dc.identifier.issue	1	en
dc.identifier.spage	7	en
dc.identifier.epage	15	en