The maximum order tree method: A new approach for the optimal scheduling of product distribution lines

Mokashi, S; Kokossis, A

dc.contributor.author	Mokashi, S	en
dc.contributor.author	Kokossis, A	en
dc.date.accessioned	2014-03-01T01:13:27Z
dc.date.available	2014-03-01T01:13:27Z
dc.date.issued	1997	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12483
dc.subject	Contextual Information	en
dc.subject	Mathematical Programming	en
dc.subject	Optimal Scheduling	en
dc.subject	Real Time Application	en
dc.subject	Scheduling Problem	en
dc.subject	Chemical Process Industry	en
dc.subject	Product Distribution	en
dc.title	The maximum order tree method: A new approach for the optimal scheduling of product distribution lines	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0098-1354(97)87581-3	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0098-1354(97)87581-3	en
heal.publicationDate	1997	en
heal.abstract	Most of the research on scheduling and planning in the chemical process industry resorts to general purpose optimisation techniques. When applied to real life industrial problems, these translate into mammoth formulations dominated by the presence of discrete variables, rendering them difficult to solve. This work proposes a fresh viewpoint to approaching these problems by exploiting contextual information to tame the	en
heal.journalName	Computers & Chemical Engineering	en
dc.identifier.doi	10.1016/S0098-1354(97)87581-3	en