Scheduling dependent tasks on identical machines using a novel heuristic criterion: A robotic computation example

Tzafestas, S; Triantafyllakis, A; Rizos, G

dc.contributor.author	Tzafestas, S	en
dc.contributor.author	Triantafyllakis, A	en
dc.contributor.author	Rizos, G	en
dc.date.accessioned	2014-03-01T01:42:41Z
dc.date.available	2014-03-01T01:42:41Z
dc.date.issued	1994	en
dc.identifier.issn	09210296	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/23897
dc.subject	dependent tasks	en
dc.subject	dispatching rules	en
dc.subject	heuristic algorithms	en
dc.subject	list scheduling algorithms	en
dc.subject	makespan criterion	en
dc.subject	Scheduling problems	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational complexity	en
dc.subject.other	Dynamics	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Machine tools	en
dc.subject.other	Optimization	en
dc.subject.other	Scheduling	en
dc.subject.other	Dependent tasks	en
dc.subject.other	Dispatching rules	en
dc.subject.other	Heuristic algorithms	en
dc.subject.other	List scheduling algorithms	en
dc.subject.other	Makespan criterion	en
dc.subject.other	Scheduling problems	en
dc.subject.other	Robotics	en
dc.title	Scheduling dependent tasks on identical machines using a novel heuristic criterion: A robotic computation example	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF01262962	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF01262962	en
heal.publicationDate	1994	en
heal.abstract	The problem of scheduling n dependent tasks, with arbitrary processing times, on m identical machines so as to minimize the makespan criterion is considered. Since this problem is NP-hard in the strong sense, it can be solved only suboptimally using heuristic approaches. Two new heuristic algorithms (dispatching rules), namely MVT/MISF and DMVT/MISF algorithms, for this problem are proposed. These algorithms are then used, together with the existing ones CP/MISF and DHLF/MISF, as a dispatching rule base of a new adaptively weighted combinatorial dispatching (AWCD) rule. This combinatorial dispatching rule has a superior behaviour compared to simple dispatching rules. Extended experimentation with these algorithms supports this argument. Here a representative robotic dynamics computation example is included. In addition, some empirical rules are derived and proposed for the selection of a simple dispatching rule (heuristic) if such a selection is required, for each particular input data set. These methods, as well as the existing optimal algorithms for special solvable cases of the considered problem, have been integrated in a decision support system (DSS). © 1995 Kluwer Academic Publishers.	en
heal.publisher	Kluwer Academic Publishers	en
heal.journalName	Journal of Intelligent & Robotic Systems	en
dc.identifier.doi	10.1007/BF01262962	en
dc.identifier.volume	12	en
dc.identifier.issue	3	en
dc.identifier.spage	229	en
dc.identifier.epage	237	en