A list-based threshold accepting method for job shop scheduling problems

Tarantilis, CD; Kiranoudis, CT

dc.contributor.author	Tarantilis, CD	en
dc.contributor.author	Kiranoudis, CT	en
dc.date.accessioned	2014-03-01T01:17:21Z
dc.date.available	2014-03-01T01:17:21Z
dc.date.issued	2002	en
dc.identifier.issn	0925-5273	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14480
dc.subject	Job shop scheduling	en
dc.subject	Metaheuristics	en
dc.subject	Threshold accepting	en
dc.subject.classification	Engineering, Industrial	en
dc.subject.classification	Engineering, Manufacturing	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Algorithms	en
dc.subject.other	Benchmarking	en
dc.subject.other	Computational complexity	en
dc.subject.other	Decision support systems	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Problem solving	en
dc.subject.other	Scheduling	en
dc.subject.other	Job shop scheduling	en
dc.subject.other	Industrial management	en
dc.title	A list-based threshold accepting method for job shop scheduling problems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0925-5273(01)00231-6	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0925-5273(01)00231-6	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	Process plants typically produce a family of related products that require similar processing techniques. The most important problem encountered in such manufacturing systems is scheduling of operations so that demand is fulfilled within a pre-described time horizon imposed by production planning. The typical scheduling operation that process plants involve can be formulated as a general job shop scheduling problem. The aim of this study is to describe a new metaheuristic method for solving the job shop scheduling problem of process plants, termed as list-based threshold accepting (LBTA) method. The main advantage of this method over the majority of other metaheuristics is that it produces quite satisfactory solutions in reasonable amount of time by tuning only one parameter of the method. This property makes the LBTA a reliable and a practical tool for every decision support system designed for solving real life scheduling problems. The LBTA is described in detail, tested over classical benchmark problems found in literature and a while characteristic job shop scheduling case study for dehydration plant operations is presented. (C) 2002 Elsevier Science B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	International Journal of Production Economics	en
dc.identifier.doi	10.1016/S0925-5273(01)00231-6	en
dc.identifier.isi	ISI:000175760900005	en
dc.identifier.volume	77	en
dc.identifier.issue	2	en
dc.identifier.spage	159	en
dc.identifier.epage	171	en