Random Start and Forward Search Applied to Solve Multi-Criterion Planning Problems

Authors:	Dang Thanh-Tung, Institute of Informatics, Slovak Academy of Sciences, Slovakia (Slovak Republic) Frankovič Baltazár, Institute of Informatics, Slovak Academy of Sciences, Slovakia (Slovak Republic) Sheahan Con, Dept. Of Manufacturing & Operations Eng., University of Limerick, Limerick, Ireland, Ireland Budinská Ivana, Institute of Informatics, Slovak Academy of Sciences, Slovakia (Slovak Republic)
Topic:	5.2 Manufacturing Modelling for Management and Control
Session:	Production Planning and Scheduling - I
Keywords:	planning, multi-criterion optimization, forward search

Abstract

This paper deals with multi-criterion planning problem. Beside traditional constraints, we assume that tasks can migrate between resources and they are executable by many methods with different results. The random start & forward search algorithm is proposed to solve the mentioned problem, in condition, the time for solving is limited.