{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:15:46Z","timestamp":1649020546253},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,3,1]]},"abstract":"Abstract<\/jats:title>\n Majozi and Friedler [3] developed the first approach for throughput maximization, which has no need for the optimal number of time points a-priori. The feasibility of a sequence of subproblems is examined with guided search driven S-graph based approach. Although, the approach has proved to be efficient for several problems [1], it can be developed further to increase the size of addressable cases. <\/jats:p>\n In the original approach, a branching tree is generated for each subproblem separately, even though these trees can have significantly large overlaps. The presented approach exploits this redundancy to reduce the computational needs for industrial scale problems.<\/jats:p>","DOI":"10.1515\/macro-2015-0020","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T17:01:36Z","timestamp":1431450096000},"page":"201-210","source":"Crossref","is-referenced-by-count":0,"title":["Throughput Maximization with S-graph Framework using Global Branching Tree"],"prefix":"10.1515","volume":"1","author":[{"given":"Tibor","family":"Holczinger","sequence":"first","affiliation":[{"name":"Department of System and Computer Science, Faculty of Information Technology, Pannon University, Veszpr\u00e9m"}]},{"given":"\u00c1kos","family":"Orosz","sequence":"additional","affiliation":[{"name":"Department of System and Computer Science, Faculty of Information Technology, Pannon University, Veszpr\u00e9m"}]}],"member":"374","published-online":{"date-parts":[[2015,5,9]]},"container-title":["MACRo 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/content.sciendo.com\/view\/journals\/macro\/1\/1\/article-p201.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/macro-2015-0020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T03:08:33Z","timestamp":1617764913000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/macro-2015-0020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,5,9]]},"published-print":{"date-parts":[[2015,3,1]]}},"alternative-id":["10.1515\/macro-2015-0020"],"URL":"https:\/\/doi.org\/10.1515\/macro-2015-0020","relation":{},"ISSN":["2247-0948"],"issn-type":[{"value":"2247-0948","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,1]]}}}