Production scheduling with complex precedence constraints in parallel machines

El Raheb, K; Kiranoudis, CT; Repoussis, PP; Tarantilis, CD

dc.contributor.author	El Raheb, K	en
dc.contributor.author	Kiranoudis, CT	en
dc.contributor.author	Repoussis, PP	en
dc.contributor.author	Tarantilis, CD	en
dc.date.accessioned	2014-03-01T01:22:58Z
dc.date.available	2014-03-01T01:22:58Z
dc.date.issued	2005	en
dc.identifier.issn	1335-9150	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/16749
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-30844473076&partnerID=40&md5=51ef1be1281f65d393b88568a0f4c863	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/cai/cai24.html#RahebKRT05	en
dc.subject	Heuristic search	en
dc.subject	Parallel machine scheduling	en
dc.subject	Precedence constraints	en
dc.subject.classification	Computer Science, Artificial Intelligence	en
dc.subject.other	VEHICLE-ROUTING PROBLEM	en
dc.subject.other	DEPENDENT SETUP TIMES	en
dc.subject.other	APPROXIMATION ALGORITHM	en
dc.subject.other	LOCAL SEARCH	en
dc.subject.other	PROJECT	en
dc.title	Production scheduling with complex precedence constraints in parallel machines	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	Heuristic search is a core area of artificial intelligence and the employment of an efficient search algorithm is critical to the performance of an intelligent system. This paper addresses a production scheduling problem with complex precedence constraints in an identical parallel machines environment. Although this particular problem can be found in several production and other scheduling applications; it is considered to be A(P-hard due to its high computational complexity. The solution approach we adopt is based on a comparison among several dispatching rules combined with a diagram analysis methodology. Computational results on large instances provide relatively high quality practical solutions in very short computational times, indicating the applicability of the methodology in real life-production scheduling applications.	en
heal.publisher	SLOVAK ACADEMY SCIENCES INST INFORMATICS	en
heal.journalName	Computing and Informatics	en
dc.identifier.isi	ISI:000234751700005	en
dc.identifier.volume	24	en
dc.identifier.issue	3	en
dc.identifier.spage	297	en
dc.identifier.epage	319	en