{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:29:57Z","timestamp":1648963797235},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,11,8]],"date-time":"2005-11-08T00:00:00Z","timestamp":1131408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s00186-005-0016-6","type":"journal-article","created":{"date-parts":[[2005,11,10]],"date-time":"2005-11-10T09:02:41Z","timestamp":1131613361000},"page":"329-340","source":"Crossref","is-referenced-by-count":0,"title":["Graph models for scheduling systems with machine saturation property"],"prefix":"10.1007","volume":"63","author":[{"given":"Paolo","family":"Dell\u2019Olmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monica","family":"Gentili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,8]]},"reference":[{"key":"16_CR1","unstructured":"Berge C. (1973). Graphs and hypergraphs. North-Holland, Amsterdam, and American Elsevier, New York"},{"key":"16_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker P. (2001). Scheduling algorithms. Springer, Berlin Heidelberg New York"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0020-0190(96)00196-2","volume":"61","author":"P. Dell\u2019Olmo","year":"1997a","unstructured":"Dell\u2019Olmo P., Giordani S., Speranza MG. (1997a). An approximation result for a duo-processor task scheduling problem. Inf Process Lett 61:195\u2013200","journal-title":"Inf Process Lett"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(97)84781-4","volume":"164","author":"P. Dell\u2019Olmo","year":"1997b","unstructured":"Dell\u2019Olmo P., Speranza MG., Tuza Z. (1997b). Efficiency and effectiveness of normal schedules on three dedicated processors. Discrete Math 164:67\u201379","journal-title":"Discrete Math"},{"key":"16_CR5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F. Harary","year":"1969","unstructured":"Harary F. (1969). Graph theory. Addison-Wesley, Reading"},{"key":"16_CR6","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC. Golumbic","year":"1980","unstructured":"Golumbic MC. (1980). Algorithmic graph theory and perfect graphs. Academic, New York-London-Toronto Ont"},{"key":"16_CR7","first-page":"3","volume":"32","author":"CK. Lim","year":"1991","unstructured":"Lim CK., Peng YH. (1991). Uniquely pseudointersectable graphs. Ars Combinatoria 32:3\u201311","journal-title":"Ars Combinatoria"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L. (1972). A characterization of perfect graphs. J Comb Theory B 13:95\u201398","journal-title":"J Comb Theory B"},{"key":"16_CR9","first-page":"479","volume-title":"The theory and application of graphs.","author":"RJ Opsut","year":"1981","unstructured":"Opsut RJ, Roberts FS (1981) On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems. In: Chartrand G, Alavi Y, Goldsmith DL, Lesniak-Foster L, Lick DR (eds). The theory and application of graphs. Wiley, New York, pp. 479\u2013192"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(85)90061-7","volume":"10","author":"FS Roberts","year":"1985","unstructured":"Roberts FS (1985). Application of edge coverings by cliques. Discrete Appl Math 10:93\u2013109","journal-title":"Discrete Appl Math"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s003730050068","volume":"15","author":"ER Scheinerman","year":"1999","unstructured":"Scheinerman ER, Trenk AN (1999). On the fractional intersection number of a graph. Graph Comb 15:341\u2013351","journal-title":"Graph Comb"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0016-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-005-0016-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0016-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:23Z","timestamp":1558622003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-005-0016-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,8]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s00186-005-0016-6","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,8]]}}}