{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:03:32Z","timestamp":1649099012490},"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 We consider different online algorithms for a generalized scheduling problem for parallel machines, described in details in the second section. This problem is the generalization of the classical parallel machine scheduling problem, when the makespan is minimized; in that case each job contains only one task. On the other hand, the problem in consideration is still a special version of the workflow scheduling problem. We present several heuristic algorithms and compare them by computer tests.<\/jats:p>","DOI":"10.1515\/macro-2015-0019","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T17:01:36Z","timestamp":1431450096000},"page":"193-200","source":"Crossref","is-referenced-by-count":0,"title":["Online Algorithms for a Generalized Parallel Machine Scheduling Problem"],"prefix":"10.1515","volume":"1","author":[{"given":"Istv\u00e1n","family":"Szalkai","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Pannonia, Veszpr\u00e9m, Hungary"}]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Pannonia, Veszpr\u00e9m, Hungary"}]}],"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-p193.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/macro-2015-0019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T02:56:02Z","timestamp":1617764162000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/macro-2015-0019"}},"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-0019"],"URL":"https:\/\/doi.org\/10.1515\/macro-2015-0019","relation":{},"ISSN":["2247-0948"],"issn-type":[{"value":"2247-0948","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,1]]}}}