HEAL DSpace

Hierarchical control approach to a composite inventory-marketing problem

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Kapsiotis, G en
dc.contributor.author Tzafestas, S en
dc.date.accessioned 2014-03-01T01:09:54Z
dc.date.available 2014-03-01T01:09:54Z
dc.date.issued 1994 en
dc.identifier.issn 0921-0296 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/11242
dc.subject advertisement process en
dc.subject dual optimization technique en
dc.subject hierarchical control en
dc.subject Inventory-marketing problem en
dc.subject.classification Computer Science, Artificial Intelligence en
dc.subject.classification Robotics en
dc.subject.other Algorithms en
dc.subject.other Hierarchical systems en
dc.subject.other Inventory control en
dc.subject.other Marketing en
dc.subject.other Optimization en
dc.subject.other Problem solving en
dc.subject.other Composite inventory marketing problem en
dc.subject.other Dual optimization technique en
dc.subject.other Hierarchical control en
dc.subject.other Production control en
dc.title Hierarchical control approach to a composite inventory-marketing problem en
heal.type journalArticle en
heal.identifier.primary 10.1007/BF01254015 en
heal.identifier.secondary http://dx.doi.org/10.1007/BF01254015 en
heal.language English en
heal.publicationDate 1994 en
heal.abstract A composite inventory-marketing problem is considered and treated for the case where there exist distributed time delays in the supply and/or the advertisement process, as well as product losses at constant rates. Since in a real large-scale situation a centralized solution may be impractical, two hierarchical coordinated control algorithms are presented which are based on a proper decomposition of the overall problem. Backlogging is not permitted and the delays are assumed fixed and known. The first algorithm makes use of the dual optimization technique, whereas the second algorithm is based on a decentralized procedure which allows each of the company's departments to solve its problem individually, and then with the coordination of an upper level to obtain the overall solution. Numerical examples are included which illustrate the effectiveness of the two algorithms. © 1995 Kluwer Academic Publishers. en
heal.publisher Kluwer Academic Publishers en
heal.journalName Journal of Intelligent & Robotic Systems en
dc.identifier.doi 10.1007/BF01254015 en
dc.identifier.isi ISI:A1994RA99300004 en
dc.identifier.volume 11 en
dc.identifier.issue 3 en
dc.identifier.spage 293 en
dc.identifier.epage 309 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record